English
Related papers

Related papers: Hyperarbres, arbres enracin\'{e}s et partitions po…

200 papers

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

Combinatorics · Mathematics 2019-10-07 Tricia Muldoon Brown

The operad $\mathrm{FMan}$ encodes the algebraic structure on vector fields of Frobenius manifolds, in the same way as the operad $\mathrm{Lie}$ encodes the algebraic structure on vector fields of a smooth manifold. It is well known that…

Quantum Algebra · Mathematics 2024-02-01 Paul Laubie

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic…

Combinatorics · Mathematics 2020-09-22 Bob Lutz

The `Weyl symmetric functions' studied here naturally generalize classical symmetric (polynomial) functions, and `Weyl bialternants,' sometimes also called Weyl characters, analogize the Schur functions. For this generalization, the…

Combinatorics · Mathematics 2021-09-08 Robert G. Donnelly

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

Combinatorics · Mathematics 2012-05-22 Dmitri I. Panyushev

We prove that the hyperbolicity cones of elementary symmetric polynomials are spectrahedral, i.e., they are slices of the cone of positive semidefinite matrices. The proof uses the matrix--tree theorem, an idea already present in Choe et…

Optimization and Control · Mathematics 2013-09-23 Petter Brändén

We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known…

Mathematical Physics · Physics 2008-11-26 Andrea Bedini , Sergio Caracciolo , Andrea Sportiello

A poset is Esakia representable when it is isomorphic to the prime spectrum of a Heyting algebra. Notably, every Esakia representable poset is also the spectrum of a commutative ring with unit. The problem of describing the Esakia…

Logic · Mathematics 2024-10-08 Damiano Fornasiere , Tommaso Moraschini

Hypergraphic polytopes $\Delta_{\mathbb{H}}$ arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph $\mathbb{H}$. Orienting the $1$-skeleton of such a polytope by a certain generic linear functional gives rise to the…

Combinatorics · Mathematics 2026-05-06 Félix Gélinas , Yirong Yang

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

This paper introduces an inductively defined tree notation for all the faces of polytopes arising from a simplex by truncations. This notation allows us to view inclusion of faces as the process of contracting tree edges. Our notation…

Combinatorics · Mathematics 2017-08-10 Pierre-Louis Curien , Jovana Obradovic , Jelena Ivanovic

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…

Combinatorics · Mathematics 2007-05-23 Eva Maria Feichtner

We introduce two definitions of $G$-equivariant partitions of a finite $G$-set, both of which yield $G$-equivariant partition complexes. By considering suitable notions of equivariant trees, we show that $G$-equivariant partitions and…

Algebraic Topology · Mathematics 2026-02-04 Julia E. Bergner , Peter Bonventre , Maxine E. Calle , David Chan , Maru Sarazola

We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…

Symplectic Geometry · Mathematics 2019-06-13 Christian Herrmann , Jonathan Lorand , Alan Weinstein

We compute the Coxeter polynomial of a family of Salem trees, and also the limit of the spectral radii of their Coxeter transformations as the number of their vertices tends to infinity. We also prove a relation about multiplicities of…

Spectral Theory · Mathematics 2015-09-30 Charalampos A. Evripidou

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…

Combinatorics · Mathematics 2007-05-23 Samuel K. Hsiao , T. Kyle Petersen

We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…

Combinatorics · Mathematics 2021-10-28 Alexander Lazar

This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…

Combinatorics · Mathematics 2022-05-31 Aleksey Bolotnikov