Related papers: The Cone of Cyclic Sieving Phenomena
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a…
Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…
The property of cyclicity of a linear operator, or equivalently the property of simplicity of its spectrum, is an important spectral characteristic that appears in many problems of functional analysis and applications to mathematical…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
In this paper and in its sequel [BKLV], we investigate the cone ${\rm Pseff}_n(C_d)$ of pseudoeffective $n$-cycles in the symmetric product $C_d$ of a smooth curve $C$. In the present paper, we study the convex-geometric properties of the…
Let ${\cal S}_+^n \subset {\cal S}^n$ be the cone of positive semi-definite matrices as a subset of the vector space of real symmetric $n \times n$ matrices. The intersection of ${\cal S}_+^n$ with a linear subspace of ${\cal S}^n$ is…
P-resolutions of a cyclic quotient singularity are known to be in one-to-one correspondence with the components of the base space of its semi-universal deformation. Stevens and Christophersen have shown that P-resolutions are parametrized…
A circle, centered at the origin and with radius chosen so that it has non-empty intersection with the integer lattice $\mathbb{Z}^{2}$, gives rise to a probability measure on the unit circle in a natural way. Such measures, and their weak…
We construct examples of projective toric surfaces whose blow-up at a general point has a non-polyhedral pseudo-effective cone, both in characteristic $0$ and in every prime characteristic $p$. As a consequence, we prove that the…
Cone spherical metrics, defined on compact Riemann surfaces, are conformal metrics with constant curvature one and finitely many cone singularities. Such a metric is termed \textit{reducible} if a developing map of the metric has monodromy…
In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls.…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
We introduce and study a cone which consists of a class of generalized polynomial functions and which provides a common framework for recent non-negativity certificates of polynomials in sparse settings. Specifically, this…
We review various combinatorial interpretations and mappings of stationary-state probabilities of the totally asymmetric, partially asymmetric and symmetric simple exclusion processes (TASEP, PASEP, SSEP respectively). In these steady…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…