Related papers: Unimodality and the reflection principle
Inspired by the theory of hyperbolic polynomials and Hodge theory, we develop the theory of Lorentzian polynomials on cones. This notion captures the Hodge-Riemann relations of degree zero and one. Motivated by fundamental properties of…
For modules over a finite-dimensional algebra, there is a canonical one-to-one correspondence between the projective indecomposable modules and the simple modules. In this purely expository note, we take a straight-line path from the…
We improve upon an Omega result due to Soundararajan with respect to general trigonometric polynomials having positive Fourier coefficients. Instead of Dirichlet's approximation theorem we employ the resonance method and this leads to…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
We obtain a family of explicit "polyhedral" combinatorial expressions for multiplicities in the tensor product of two simple finite-dimensional modules over a complex semisimple Lie algebra. Here "polyhedral" means that the multiplicity in…
We introduce and study a class of Lie algebroids associated to faithful modules which is motivated by the notion of cotangent Lie algebroids of Poisson manifolds. We also give a classification of transitive Lie algebroids and describe…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
Shape constraints enable us to reflect prior knowledge in regression settings. A unimodality constraint, for example, can describe the frequent case of a first increasing and then decreasing intensity. Yet, data shapes often exhibit…
The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…
We prove a recent conjecture of Lassalle about positivity and integrality of coefficients in some polynomial expansions. We also give a combinatorial interpretation of those numbers. Finally, we show that this question is closely related to…