English
Related papers

Related papers: Birational rowmotion and coxeter-motion on minuscu…

200 papers

We define a poset of partitions associated to an operad. We prove that the operad is Koszul if and only if the poset is Cohen-Macaulay. In one hand, this characterisation allows us to compute the homology of the poset. This homology is…

Algebraic Topology · Mathematics 2011-03-31 Bruno Vallette

We investigate analogues of alternating sign matrices, called partial alternating sign matrices. We prove bijections between these matrices and several other combinatorial objects. We use an analogue of Wieland's gyration on fully-packed…

Combinatorics · Mathematics 2024-03-05 Dylan Heuer

From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…

Algebraic Geometry · Mathematics 2015-08-18 Han-Bom Moon , Charles Summers , James von Albade , Ranze Xie

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

Combinatorics · Mathematics 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

We demonstrate that a quiet state and large-amplitude self-sustained oscillations can co-exist in a carbon nanotube subject to time-independent drive. A feature of the bistability is that it would be hysteresis-free in the absence of noise…

Mesoscale and Nanoscale Physics · Physics 2025-05-01 P. Belardinelli , W. Yang , A. Bachtold , M. I. Dykman , F. Alijani

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

Dynamical Systems · Mathematics 2022-01-07 A. Baraviera , R. Leplaideur

Interchange theorems between minimization and integration are useful in optimization, especially in optimal control and in stochastic optimization. In this article, we establish a generalized minimization interchange theorem, where…

Optimization and Control · Mathematics 2021-07-14 Jean-Philippe Chancelier , Michel de Lara , Benoît Tran

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…

Logic · Mathematics 2020-11-26 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

We investigate a Bose Einstein condensate held in a 1D optical lattice whose phase undergoes a fast oscillation using a statistical analysis. The averaged potential experienced by the atoms boils down to a periodic potential having the same…

We study the dynamics of a soliton-impurity system modeled in terms of a binary Bose-Einstein condensate. This is achieved by `switching off' one of the two self-interaction scattering lengths, giving a two component system where the second…

Quantum Gases · Physics 2019-05-14 M. J. Edmonds , J. L. Helm , Th. Busch

We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…

Combinatorics · Mathematics 2020-07-21 Gábor Hetyei

This paper shows how to construct a discrete Morse function with a relatively small number of critical cells for the order complex of any finite poset with $\hat{0} $ and $\hat{1}$ from any lexicographic order on its maximal chains.…

Algebraic Topology · Mathematics 2018-08-23 Eric Babson , Patricia Hersh

Special matchings are purely combinatorial objects associated with a partially ordered set, which have applications in Coxeter group theory. We provide an explicit characterization and a complete classification of all special matchings of…

Combinatorics · Mathematics 2016-12-13 Fabrizio Caselli , Mario Marietti

Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example (the Rauzy dynamics) concerns an action on permutations, associated to interval exchange transformations (IET) for the…

Combinatorics · Mathematics 2018-02-20 Quentin De Mourgues

The absolute order on the hyperoctahedral group $B_n$ is investigated. It is proved that the order ideal of this poset generated by the Coxeter elements is homotopy Cohen-Macaulay and the M\"obius number of this ideal is computed. Moreover,…

Combinatorics · Mathematics 2010-03-26 Myrto Kallipoliti

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

Covtree - a partial order on certain sets of finite, unlabeled causal sets - is a manifestly covariant framework for causal set dynamics. Here, as a first step in picking out a class of physically well-motivated covtree dynamics, we study…

General Relativity and Quantum Cosmology · Physics 2021-02-03 Stav Zalel

We define, for any special matching of a finite graded poset, an idempotent, regressive and order preserving function. We consider the monoid generated by such functions. The idempotents of this monoid are called special idempotents. They…

Combinatorics · Mathematics 2021-05-20 P. Sentinelli

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz