English
Related papers

Related papers: Composition closed premodel structures and the Kre…

200 papers

Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…

Discrete Mathematics · Computer Science 2026-04-09 Hector Buffière , Yuquan Lin , Jaroslav Nešet{ř}il , Patrice Ossona de Mendez , Sebastian Siebertz

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

Combinatorics · Mathematics 2007-05-23 Thomas Brady , Colum Watt

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

Algebraic Geometry · Mathematics 2021-11-02 Benoît Guerville-Ballé

We study the designability of all compact 3x3x3 and 6x6 lattice-protein structures using the Miyazawa-Jernigan (MJ) matrix. The designability of a structure is the number of sequences that design the structure, i.e. sequences that have that…

Statistical Mechanics · Physics 2007-05-23 Hao Li , Chao Tang , Ned Wingreen

We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…

Logic in Computer Science · Computer Science 2009-11-13 Luca Bernardinello , Lucia Pomello , Stefania Rombolà

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…

Rings and Algebras · Mathematics 2021-02-08 Leonard Kwuida , Claudia Mureşan

We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…

We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of…

Quantum Algebra · Mathematics 2010-03-17 Istvan Heckenberger , Volkmar Welker

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

On the study of protein folding, our understanding about the protein structures is limited. In this paper we find one way to characterize the compact structures of lattice protein model. A quantity called Partnum is given to each compact…

Biological Physics · Physics 2009-11-06 Bin Wang , Zu-guo Yu

We propose two optimization-based heuristics for structure selection and identification of PieceWise Affine (PWA) models with exogenous inputs. The first method determines the number of affine sub-models assuming known model order of the…

Systems and Control · Electrical Eng. & Systems 2020-10-06 Valentina Breschi , Manas Mejari

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

Protein structures in nature often exhibit a high degree of regularity (secondary structures, tertiary symmetries, etc.) absent in random compact conformations. We demonstrate in a simple lattice model of protein folding that structural…

Condensed Matter · Physics 2009-10-28 Hao Li , Robert Helling , Chao Tang , Ned Wingreen

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Logic · Mathematics 2022-07-19 Deacon Linkhorn

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Combinatorics · Mathematics 2017-02-28 Reinhard Diestel

We consider the potential for novel forms of magnetism arising from the subtle interplay between electrons and spins in the under-screened kagome Kondo lattice model. At weak coupling, we show that incommensurate non-coplanar multi-wave…

Strongly Correlated Electrons · Physics 2015-08-05 Shivam Ghosh , Patrick O' Brien , Christopher L. Henley , Michael J. Lawler

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

Combinatorics · Mathematics 2022-12-05 Hung Phuc Hoang , Torsten Mütze

In a recent paper we introduced a much weaker and easy to verify structure than a model category, which we called a "weak fibration category". We further showed that a small weak fibration category can be "completed" into a full model…

Category Theory · Mathematics 2015-07-03 Ilan Barnea , Tomer M. Schlank

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty