Related papers: Generalized recursive atom ordering and equivalenc…
We construct an ungraded CL-shellable poset and a graded CL-shellable poset and show that neither is EL-shellable.
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…
In the search for vacuum solutions, with or without a cosmological constant, of the Einstein field equations of Petrov type N with twisting principal null directions, the CR structures to describe the parameter space for a congruence of…
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…
The purpose of this paper is twofold: 1. we prove the triangulability of smooth orbifolds with corners, generalizing the same statement for orbifolds. 2. based on 1, we propose a new homology theory. We call it geometric homology theory…
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…
In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…
The structure ${\cal C}_2:=(1^\infty,\le,\le_1,\le_2)$, introduced and first analyzed in Carlson and Wilken 2012 (APAL), is shown to be elementary recursive. Here, $1^\infty$ denotes the proof-theoretic ordinal of the fragment…
Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
Molecular dynamics simulations for aqueous sodium chloride solutions were carried out at various concentrations. Supplementary to the Debye-H\"uckel theory, reversible transient nucleation of ions was observed even in dilute solutions. The…
The collective dynamics of mobile scatterers and light in optical resonators generates complex behaviour. For strong transverse illumination a phase transition from homogeneous to crystalline particle order appears. In contrast, a gas…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
The quantum-to-classical transition hinges on the nature of wavefunction collapse, which remains a central controversy in foundational physics. Objective collapse theories aim to modify quantum mechanics by introducing a physical,…
Since their introduction by Stanley~\cite{StanleyOrderPoly} order polytopes have been intriguing mathematicians as their geometry can be used to examine (algebraic) properties of finite posets. In this paper, we follow this route to examine…
Achieving and exceeding the diversity of colloidal analogs of chemical elements and molecules as building blocks of matter has been the central goal and challenge of colloidal science ever since Einstein introduced the colloidal atom…
The Data Clustering (DC) problem is of central importance for the area of Machine Learning (ML), given its usefulness to represent data structural similarities from input spaces. Differently from Supervised Machine Learning (SML), which…
We give an alternative proof of the theorem by Kuznetsov and Lunts, stating that any separated scheme of finite type over a field of characteristic zero admits a categorical resolution of singularities. Their construction makes use of the…
We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…