Related papers: Log-concavity and log-convexity via distributive l…
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…
The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…
We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…
We prove an effective equidistribution theorem for orbits of certain unipotent subgroups in arithmetic quotients of perfect Lie groups with a polynomial error term. Even for semisimple quotients, our result provides the first infinite…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
The Swing Lemma of the second author describes how a congruence spreads from a prime interval to another in a slim (having no $M_3$ sublattice), planar, semimodular lattice. We generalize the Swing Lemma to planar semimodular lattices.
Given a sequence (a_k) = a_0, a_1, a_2,... of real numbers, define a new sequence L(a_k) = (b_k) where b_k = a_k^2 - a_{k-1} a_{k+1}. So (a_k) is log-concave if and only if (b_k) is a nonnegative sequence. Call (a_k) "infinitely…
We prove that the lattice of ideals of an arbitrary $L$-algebra is distributive. As a consequence, a spectral theory applies with no restriction. We also study the spectrum (i.e. the set of prime ideals) of $L$-algebras and characterize…
Strongly log-concave (SLC) distributions are a rich class of discrete probability distributions over subsets of some ground set. They are strictly more general than strongly Rayleigh (SR) distributions such as the well-known determinantal…
We show that every symmetric random variable with log-concave tails satisfies the convex infimum convolution inequality with an optimal cost function (up to scaling). As a result, we obtain nearly optimal comparison of weak and strong…
In this paper, we study power series with coefficients equal to a product of a generic sequence and an explicitly given function of a positive parameter expressible in terms of the Pochhammer symbols. Four types of such series are treated.…
A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…
Sampling from Gibbs distributions and computing their log-partition function are fundamental tasks in statistics, machine learning, and statistical physics. While efficient algorithms are known for log-concave densities, the worst-case…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
We study the error of the number of points of a lattice $L$ that belong to a rectangle, centred at $0$, whose axes are parallel to the coordinate axes, dilated by a factor $t$ and then translated by a vector $X \in \mathbb{R}^{2}$. When we…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
We show that normalized Schur polynomials are strongly log-concave. As a consequence, we obtain Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients in the special case of Kostka numbers.
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…