English
Related papers

Related papers: Poset subdivisions and the mixed cd-index

200 papers

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

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

This paper extends our earlier work where we constructed ``minuscule'' representations of Kac--Moody algebras from colored posets in a way that maintains key properties of the well-known minuscule representations of simple Lie algebras. In…

Combinatorics · Mathematics 2025-06-17 Michael C. Strayer

A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…

Combinatorics · Mathematics 2022-09-14 Edgar Jaramillo-Rodriguez

Let $f(x) \in \bbz[x]$ and consider the index divisibility set $D = \{n \in \bbn : n \mid f^n(0)\}$. We present a number of properties of $D$ in the case that $(f^n(0))_{n=1}^\infty$ is a rigid divisibility sequence, generalizing a number…

Number Theory · Mathematics 2017-09-27 T. Alden Gassert , Michael T. Urbanski

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…

Algebraic Topology · Mathematics 2025-10-09 Bjørnar Gullikstad Hem

We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Combinatorics · Mathematics 2024-09-11 T. Kyle Petersen , Yan Zhuang

The flow in a fixed direction on a translation surface S determines a decomposition of S into closed invariant sets, each of which is either periodic or minimal. We study this decomposition for translation surfaces in the hyperelliptic…

Dynamical Systems · Mathematics 2013-02-15 Kathryn Lindsey

This paper proposes a novel, nonparametric, interpoint distance-based measure to investigate whether there exist any groups in a set of given data, and if so then, how many groups are prevailing in total. It is a cluster accuracy index…

Methodology · Statistics 2026-05-21 Soumita Modak

A new index for internal evaluation of clustering is introduced. The index is defined as a mixture of two sub-indices. The first sub-index $ I_a $ is called the Ambiguous Index; the second sub-index $ I_s $ is called the Similarity Index.…

Machine Learning · Computer Science 2024-06-18 Gangli Liu

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders…

Dynamical Systems · Mathematics 2024-01-09 Yang Cao , Jianjie Zhao

We relate in a novel way the modular matrices of GKO diagonal cosets without fixed points to those of WZNW tensor products. Using this we classify all modular invariant partition functions of $su(3)_k\oplus su(3)_1/su(3)_{k+1}$ for all…

High Energy Physics - Theory · Physics 2009-10-28 Terry Gannon , Mark A. Walton

The article is devoted to a comparison of the \v{C}ech cohomology with the coefficients in a presheaf of Abelian groups and the topos cohomology of the sheaf generated by this presheaf for a poset with the Aleksandrov topology. The article…

Algebraic Topology · Mathematics 2026-02-19 Ahmet A. Husainov

A categorification of a polynomial link invariant is an homological invariant which contains the polynomial one as its graded Euler characteristic. This field has been initiated by Khovanov categorification of the Jones polynomial. Later,…

Geometric Topology · Mathematics 2008-04-01 Benjamin Audoux

Numerical differentiation of a function, contaminated with noise, over the unit interval $[0,1] \subset \mathbb{R}$ by inverting the simple integration operator $J:L^2([0,1]) \to L^2([0,1])$ defined as $[Jx](s):=\int_0^s x(t) dt$ is…

Numerical Analysis · Mathematics 2023-05-24 Bernd Hofmann , Hans-Jürgen Fischer , Robert Plato

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

We give a simple development of the concentration properties of compound Poisson measures on the nonnegative integers. A new modification of the Herbst argument is applied to an appropriate modified logarithmic-Sobolev inequality to derive…

Probability · Mathematics 2024-05-07 I. Kontoyiannis , M. Madiman

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph. In this paper we…

Combinatorics · Mathematics 2024-02-19 Saeid Alikhani , Mohammad H. Akhbari , C. Eslahchi , Roslan Hasni