459,383 research outputs found
Balance constants for Coxeter groups
The - Conjecture, originally formulated in 1968, is one of the
best-known open problems in the theory of posets, stating that the balance
constant (a quantity determined by the linear extensions) of any non-total
order is at least . By reinterpreting balance constants of posets in terms
of convex subsets of the symmetric group, we extend the study of balance
constants to convex subsets of any Coxeter group. Remarkably, we conjecture
that the lower bound of still applies in any finite Weyl group, with new
and interesting equality cases appearing.
We generalize several of the main results towards the - Conjecture
to this new setting: we prove our conjecture when is a weak order interval
below a fully commutative element in any acyclic Coxeter group (an
generalization of the case of width-two posets), we give a uniform lower bound
for balance constants in all finite Weyl groups using a new generalization of
order polytopes to this context, and we introduce generalized semiorders for
which we resolve the conjecture.
We hope this new perspective may shed light on the proper level of generality
in which to consider the - Conjecture, and therefore on which methods
are likely to be successful in resolving it.Comment: 27 page
The sum-capture problem for abelian groups
Let be a finite abelian group, let , and let be a random set of size . We let
The issue is to determine upper bounds on that hold with high
probability over the random choice of . Mennink and Preneel \cite{BM}
conjecture that should be close to (up to possible logarithmic
factors in ) for and that should not much
exceed for . We prove the second half of this
conjecture by showing that with high probability, for all . We note that for .
In previous work, Alon et al have shown that
with high probability for while Kiltz, Pietrzak and Szegedy
show that with high probability for . Current bounds on are essentially sharp for the range . Finding better bounds remains an open problem for the
range and especially for the range in
which the bound of Kiltz et al doesn't improve on the bound given in this
paper (even if that bound applied). Moreover the conjecture of Mennink and
Preneel for remains open
The variance conjecture on projections of the cube
We prove that the uniform probability measure on every
-dimensional projection of the -dimensional unit cube verifies the
variance conjecture with an absolute constant provided that . We also prove that if
, the conjecture is true
for the family of uniform probabilities on its projections on random
-dimensional subspaces
- …