Problems in extremal and probabilistic combinatorics: cubes, squares and permutations
<p>We begin by studying the possible intersection sizes of a $k$-dimensional linear subspace with the hypercube $\{0,1\}^n$. For a fixed $k$, the largest intersection size is $2^k$ and it was shown by Melo and Winter that the second largest intersection size is $2^{k-1} + 2^{k-2}$. We show tha...
Príomhchruthaitheoir: | Johnston, T |
---|---|
Rannpháirtithe: | Scott, A |
Formáid: | Tráchtas |
Teanga: | English |
Foilsithe / Cruthaithe: |
2021
|
Ábhair: |
Míreanna comhchosúla
Míreanna comhchosúla
-
A code for square permutations and convex permutominoes
de réir: Enrica Duchi
Foilsithe / Cruthaithe: (2019-12-01) -
Combinatorics of diagrams of permutations
de réir: Joel Brewster Lewis, et al.
Foilsithe / Cruthaithe: (2014-01-01) -
Absorptions in combinatorics
de réir: Cheng, Y
Foilsithe / Cruthaithe: (2024) -
Consecutive patterns in restricted permutations and involutions
de réir: M. Barnabei, et al.
Foilsithe / Cruthaithe: (2019-06-01) -
Associated Permutations of Complete Non-Ambiguous Trees
de réir: Daniel Chen, et al.
Foilsithe / Cruthaithe: (2024-04-01)