相关论文: Short Proofs in Algebraic and Enumerative Combinat…

Using theorems of Bangert, we prove a rigidity result which shows how a question raised by Bangert for elliptic integrands of Moser type is connected, in the case of minimal solutions without self-intersections, to a famous conjecture of De…

We employ the pinching theorem, ensuring that some operators A admit any sequence of contractions as an operator diagonal of A, to deduce/improve two recent theorems of Kennedy-Skoufranis and Loreaux-Weiss for conditional expectations onto…

We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate…

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…

In this note, we give a new simple system of global parameters on the moduli space of rational functions, and clarify the relation to the parameters indicating location of fixed points and the indices at them. As a byproduct, we solve a…

In this survey, we discuss a series of linearization problems--for Poisson structures, Lie algebroids, and Lie groupoids. The last problem involves a conjecture on the structure of proper groupoids. Attempting to prove this by the method of…

We prove a reduced version of the Chevalley restriction conjecture on the commuting scheme posed by T.H. Chen and B.C. Ng\^o, extending the results of Hunziker for classical groups. In particular, we prove that for any connected reductive…

We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…

This is a review of two of the fundamental tools for analysis of soliton equations: i) the algebraic ones based on Kac-Moody algebras, their central extensions and their dual algebras which underlie the Hamiltonian structures of the NLEE;…

Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…

We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected…

Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

We consider the monomial expansion of the $q$-Whittaker and modified Hall-Littlewood polynomialsarising from specialization of the modified Macdonald polynomial. The two combinatorial formulas for the latter due to Haglund, Haiman, and…

We prove the Box Conjecture for pairs of commuting nilpotent matrices, as formulated by Iarrobino et al [28]. This describes the Jordan type of the dense orbit in the nilpotent commutator of a given nilpotent matrix. Our main tool is the…

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…

We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration problems, e.g., from graph theory, Gray code enumeration, and…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…