English
Related papers

Related papers: Generating naturally labeled posets through matrix…

200 papers

To every labeled poset (P,\omega), one can associate a quasisymmetric generating function for its (P,\omega)-partitions. We ask: when do two labeled posets have the same generating function? Since the special case corresponding to skew…

Combinatorics · Mathematics 2014-08-13 Peter R. W. McNamara , Ryan E. Ward

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Combinatorics · Mathematics 2015-03-03 Thomas Gobet , Nathan Williams

Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the…

Combinatorics · Mathematics 2020-02-13 Claude Laflamme , Maurice Pouzet , Norbert Sauer , Robert Woodrow

We study $k$-positive linear maps on matrix algebras and address two problems, (i) characterizations of $k$-positivity and (ii) generation of non-decomposable $k$-positive maps. On the characterization side, we derive optimization-based…

Quantum Physics · Physics 2026-01-08 Frederik vom Ende , Sumeet Khatri , Sergey Denisov

To better understand mutation-invariant and hereditary properties of quivers (and more generally skew-symmetrizable matrices), we have constructed a topology on the set of all mutation classes of quivers which we call the mutation class…

Combinatorics · Mathematics 2024-04-15 Tucker J. Ervin , Blake Jackson

To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…

Commutative Algebra · Mathematics 2017-11-08 Sonja Petrović , Apostolos Thoma , Marius Vladoiu

Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…

Combinatorics · Mathematics 2012-10-24 Péter Pál Pach , Michael Pinsker , András Pongrácz , Csaba Szabó

Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $\Omega$. A given poset (i.e., partially ordered set) $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on…

Information Theory · Computer Science 2021-07-23 Yang Xu , Haibin Kan , Guangyue Han

In this paper, we introduce a partial order on rings with involution, which is a generalization of the partial order on the set of projections in a Rickart *-ring. We prove that a *-ring with the natural partial order form a sectionally…

Rings and Algebras · Mathematics 2016-11-04 Avinash Patil , B. N. Waphare

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

Let $S\_{N}(P)$ be the poset obtained by adding a dummy vertex on each diagonal edge of the $N$'s of a finite poset $P$. We show that $S\_{N}(S\_{N}(P))$ is $N$-free. It follows that this poset is the smallest $N$-free barycentric…

Discrete Mathematics · Computer Science 2007-05-23 Maurice Pouzet , Nejib Zaguia

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Combinatorics · Mathematics 2025-08-26 Frédéric Chapoton

We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases include sorting by comparisons,…

Data Structures and Algorithms · Computer Science 2010-05-06 Jean Cardinal , Samuel Fiorini , Gwenaël Joret , Raphaël M. Jungers , J. Ian Munro

For an integer $n\geq 1$, we display a poset $\Phi_n$ whose maximal chains are in bijection with the $n\times n$ alternating sign matrices. The Hasse diagram $\widehat \Phi_n$ is obtained from the $n$-cube by adding some edges. We show that…

Combinatorics · Mathematics 2017-10-16 Paul Terwilliger

We give a framework for growth models on posets which simultaneously generalizes the Classical Sequential Growth models for posets from causal set theory and the tree growth models of natural growth and simple tree classes, the latter of…

Combinatorics · Mathematics 2024-10-25 Karen Yeats , Stav Zalel

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

In this short paper, we extend the concept of the strict order polynomial $\Omega_{P}^{\circ}(n)$, which enumerates the number of strict order-preserving maps $\phi:P\rightarrow\boldsymbol{n}$ for a poset $P$, to the extended strict order…

Combinatorics · Mathematics 2020-10-08 Johanna Langner , Henryk A. Witek

This paper is devoted to a detailed study of certain remarkable posets which form a natural partition of all abelian ideals of a Borel subalgebra. Our main result is a nice uniform formula for the dimension of maximal ideals in these…

Representation Theory · Mathematics 2007-05-23 P. Cellini , P. Papi

Let $\mathcal{P}$ be a poset on $[n]$, $\mathcal{I}(\mathcal{P})$ the set of order ideals of $\mathcal{P}$ and $E$ an equivalence relation on $\mathcal{I}(\mathcal{P})$. The concepts of the dual relation $E^*$ of an equivalence relation…

Combinatorics · Mathematics 2013-01-03 Soohak Choi , Jong Yoon Hyun , Hyun Kwang Kim , Dong Yeol Oh

A toric arrangement is an arrangement of subtori of codimension one in a real or complex torus. The poset of layers is the set of connected components of non-empty intersections of these subtori, partially ordered by reverse inclusion. In…

Combinatorics · Mathematics 2017-08-25 Matthias Lenz