We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we work out explicitly this classification for degree 3 polynomials, and other special families of polynomials. This work extends to the singular case similar considerations of Martin, Savitt, and Singer for non-singular basketballs.
Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically closed field, we further obtain an explicit (but not necessarily minimal) primary decomposition of such an ideal.
This paper studies 2-player impartial combinatorial games, where the outcomes correspond to updates of cellular automata (CA) which generalize Wolfram's elementary rule 60 and rule 110 (Cook 2004). The games extend the class of \emph{triangle placing games} (Larsson 2013) where at each stage of the game the previous player has the option to block certain hopeful moves of the next player. We also study fractals and partial convergence in a subclass of the CA.
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.
We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Zelvinsky and Fomin. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix.
The polytope structure of the associahedron is decomposed into two categories, types and classes. The classification of types is related to integer partitions, whereas the classes present a new combinatorial problem. We solve this and incorporate the results into properties of the real moduli space of Riemann spheres. Connections are discussed with relation to classic combinatorial problems as well as to other sciences.
In this paper we show that the lowest two-sided ideal of an affine Hecke algebra is affine cellular for all choices of parameters. We explicitely describe the cellular basis and we show that the basis elements have a nice decomposition when expressed in the Kazhdan-Lusztig basis. In type $A$ we provide a combinatorial description of this decomposition in term of number of paths.
Our aim in this paper is to provide a theory of discrete Riemann surfaces based on quadrilateral cellular decompositions of Riemann surfaces together with their complex structure encoded by complex weights. Previous work, in particular of Mercat, mainly focused on real weights corresponding to quadrilateral cells having orthogonal diagonals. We discuss discrete coverings, discrete exterior calculus, and discrete Abelian integrals. Our presentation includes several new notions and results such as branched coverings of discrete Riemann surfaces, the discrete Riemann-Hurwitz Formula, double poles…
Postnikov constructed a cellular decomposition of the totally nonnegative Grassmannians. The poset of cells can be described (in particular) via Grassmann necklaces. We study certain quiver Grassmannians for the cyclic quiver admitting a cellular decomposition, whose cells are naturally labeled by Grassmann necklaces. We show that the posets of cells coincide with the reversed cell posets of the cellular decomposition of the totally nonnegative Grassmannians. We investigate algebro-geometric and combinatorial properties of these quiver Grassmannians. In particular, we describe the irreducible …
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions.
We formulate several open questions related to enumerative combinatorics, which arise in the spectral analysis of Hill operators with trigonometric polynomial potentials.
We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $λ$ (a partition of $n$) is the number of multiset tableaux of shape $λ$ satisfying certain column and row strict conditions. We also present a finite generating set for the ring of $S_n$ invariant polynomials of this ring.
We give a simple characterization of the highest weight vertices in the crystal graph of the level l Fock spaces. This characterization is based on the notion of totally periodic symbols viewed as affine analogues of reverse lattice words classically used in the decomposition of tensor products of fundamental $\mathfrak{sl}_{n}$-modules. This yields a combinatorial decomposition of the Fock spaces in their irreducible components and the branching law for the restriction of the irreducible highest weight $\mathfrak{sl}_{\infty}$-modules to $\hat{\mathfrak{sl}_{e}}$.
Boij-Söderberg theory shows that the Betti table of a graded module can be written as a liner combination of pure diagrams with integer coefficients. Using Ferrers hypergraphs and simplicial polytopes, we provide interpretations of these coefficients for ideals with a d-linear resolution, their quotient rings, and for Gorenstein rings whose resolution has essentially at most two linear strands. We also establish a structural result on the decomposition in the case of quasi-Gorenstein modules.
Fermionic formulas in combinatorial Bethe ansatz consist of sums of products of q-binomial coefficients. There exist refinements without a sum that are known to yield partition functions of box-ball systems with a prescribed soliton content. In this paper, such a refined fermionic formula is extended to the periodic box-ball system and a q-analogue of the Bethe root counting formula for XXZ chain at $Δ=\infty$.
By explicitly describing a cellular decomposition we determine the Borel invariant cycles that generate the Chow groups of the quotient of a reductive group by a Levi subgroup. For illustrations we consider the variety of polarizations $\mbf{SL}_n / \mbf{S}(\mbf{GL}_p\times \mbf{GL}_q)$, and we introduce the notion of a sect for describing its cellular decomposition. In particular, for $p=q$, we show that the Bruhat order on the sect corresponding to the dense cell is isomorphic, as a poset, to the rook monoid with the Bruhat-Chevalley-Renner order.
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal resolution if $I$ has linear quotients, in which case the mapping cone in each step cones a Koszul complex onto the previously constructed resolution. Here we consider cellular realizations of these resolutions. Extending a construction of Mermin we describe a regular CW-complex that supports the resolutions of Herzog and Takayama in the case that $I$ has a…
In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be of considerable interest.
Given a combinatorial decomposition for a counting problem, we resort to the simple scheme of approximating large numbers by floating-point representations in order to obtain efficient Fully Polynomial Time Approximation Schemes (FPTASes) for it. The number of bits employed for the exponent and the mantissa will depend on the error parameter $0 < \varepsilon \leq 1$ and on the characteristics of the problem. Accordingly, we propose the first FPTASes with $1 \pm \varepsilon$ relative error for counting and generating uniformly at random a labeled DAG with a given number of vertices. This is acc…
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central roles to establish a correspondence between the rational Dyck path and the tuple of Dyck paths. We reinterpret two orders, the Young and the rotation orders, on rational Dyck paths in terms of the tuple of Dyck paths by use of the decomposition. As an application, we show a duality between $(a,b)$-Dyck paths and $(b,a)$-Dyck paths in terms of binary trees.
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of our algorithm compared to similar existing results is that it works, at least theoretically, in any dimension. Practically, there are dimensional restrictions due to the size of cellular complexes of higher dimensions, though. We prove that the algorithm is correct in the sense that it always produces a decomposition into descending and ascending regions of th…
