English
Related papers

Related papers: On piecewise-linear homeomorphisms between distrib…

200 papers

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…

Combinatorics · Mathematics 2012-07-24 Natalie Aisbett

We study a blend of two kinds of homopolymers with tendency for segragation. Cross-links between the chains of different kinds do not allow macrophase separation. Instead microphase structure appears. Starting from a microscopic model we…

Condensed Matter · Physics 2007-05-23 C. D. Sfatos , A. M. Gutin , E. I. Shakhnovich

The group of piecewise projective homeomorphisms of the line provides straightforward counter-examples to the so-called von Neumann conjecture. The examples are so simple that many additional properties can be established.

Group Theory · Mathematics 2013-09-10 Nicolas Monod

In this note, we introduce a class of cell decompositions of PL manifolds and polyhedra which are more general than triangulations yet not as general as CW complexes; we propose calling them PLCW complexes. The main result is an analog of…

Geometric Topology · Mathematics 2014-10-01 Alexander Kirillov

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Combinatorics · Mathematics 2007-05-23 Maximillian Murphy , Vincent Vatter

In the framework of algebraic topology the closed sequence of 4-dimensional polyhedra (algebraic polytopes) was defined. This sequence is started by the polytope {240}, discovered by Coxeter, and is determined by the second coordination…

Materials Science · Physics 2015-06-12 M. I. Samoylovich , A. L. Talis

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-23 Antonio Cruciani , Avinandan Das , Alesya Raevskaya , Jukka Suomela

The demand for innovative synthetic polymers with improved properties is high, but their structural complexity and vast design space hinder rapid discovery. Machine learning-guided molecular design is a promising approach to accelerate…

Soft Condensed Matter · Physics 2024-10-07 Gabriel Vogel , Jana M. Weber

A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…

Statistical Mechanics · Physics 2026-02-12 John Çamkıran , Fabian Parsch , Glenn D. Hibbard

In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Sándor Radeleczki , Laura Veres

Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel

We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov. The second one is a set of some paths configurations…

Representation Theory · Mathematics 2015-05-25 Frédéric Chapoton

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…

Quantum Algebra · Mathematics 2009-10-31 Anne Schilling , S. Ole Warnaar

We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…

Probability · Mathematics 2026-01-14 Nicolas Champagnat , Denis Villemonais

By analogy with algebraic geometry, we define a category of non-linear sheaves (quasi-coherent homotopy-sheaves of topological spaces) on projective toric varieties and prove a splitting result for its algebraic K-theory, generalising…

K-Theory and Homology · Mathematics 2010-07-30 Thomas Huettemann

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

Combinatorics · Mathematics 2020-02-24 Laurent Lyaudet

Predicting the macroscopic mechanical behavior of polymeric materials from the micro-structural features has remained a challenge for decades. Existing theoretical models often fail to accurately capture the experimental data, due to…

Soft Condensed Matter · Physics 2025-07-04 Lin Zhan , Siyu Wang , Rui Xiao , Shaoxing Qu , Paul Steinmann

We show that closures of families of unitary local systems on quasiprojective varieties for which the dimension of a graded component of Hodge filtration has a constant value can be identified with a finite union of polytopes. We also…

Algebraic Geometry · Mathematics 2008-10-20 A. Libgober

A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…

Combinatorics · Mathematics 2018-05-07 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

We consider two particles hopping on a chain with a contact interaction between them. At strong interaction, there is a molecular bound state separated by a direct gap from a continuous band of atomic states. Introducing weak disorder in…

Disordered Systems and Neural Networks · Physics 2021-11-12 Hugo Perrin , János K. Asbóth , Jean-Noël Fuchs , Rémy Mosseri