English
Related papers

Related papers: Standard Examples as Subposets of Posets

200 papers

We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…

Formal Languages and Automata Theory · Computer Science 2019-10-15 Uli Fahrenberg , Christian Johansen , Georg Struth , Ratan Bahadur Thapa

Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset…

Combinatorics · Mathematics 2026-04-15 R. Altar Ciceksiz , Victor Falgas-Ravry , Sabrina Lato , Maryam Sharifzadeh

We give conditions for $k$-point configuration sets of thin sets to have nonempty interior, applicable to a wide variety of configurations. This is a continuation of our earlier work \cite{GIT19} on 2-point configurations, extending a…

Classical Analysis and ODEs · Mathematics 2022-10-17 Allan Greenleaf , Alex Iosevich , Krystal Taylor

We prove that for every poset $P$, there is a constant $C$ such that the size of any family of subsets of $[n]$ that does not contain $P$ as an induced subposet is at most $C{\binom{n}{\lfloor\frac{n}{2}\rfloor}}$, settling a conjecture of…

Combinatorics · Mathematics 2014-09-11 Abhishek Methuku , Dömötör Pálvölgyi

Let $G$ be a discrete group. We prove that the category of $G$-posets admits a model structure that is Quillen equivalent to the standard model structure on $G$-spaces. As is already true nonequivariantly, the three classes of maps defining…

Algebraic Topology · Mathematics 2018-05-18 J. P. May , Marc Stephan , Inna Zakharevich

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

Combinatorics · Mathematics 2018-02-19 Ian T. Johnson

A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their…

Combinatorics · Mathematics 2011-03-01 M. D. Atkinson , Bruce E. Sagan , Vincent Vatter

For a finite set of points $V=\{v_1, \dots, v_m\}$ in Euclidean space $\mathbb{R}^d$ and a point $r \in \mathbb{R}^d$, a subset $S \subset V$ is called $r$-balanced if $\mathrm{relint}(\mathrm{conv}(S)) \cap r \neq \emptyset$. In the case…

Combinatorics · Mathematics 2025-12-10 Mikhail V. Bludov

Suppose that $A \subset \{1,\dots, N\}$ has no two elements differing by $p-1$, $p$ prime. Then $|A| \ll N^{1 - c}$.

Number Theory · Mathematics 2023-08-24 Ben Green

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

General Topology · Mathematics 2007-05-23 R. Breslav , A. Stavrova , R. R. Zapatrin

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Rings and Algebras · Mathematics 2021-03-24 Ivan Chajda , Helmut Länger

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

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

Combinatorics · Mathematics 2024-08-01 Swee Hong Chan , Igor Pak

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

We present a counter-example to the recent claim that supermultiplets of N-extended supersymmetry with no central charge and in 1-dimension are specified unambiguously by providing the numbers of component fields in all available…

High Energy Physics - Theory · Physics 2012-08-27 C. F. Doran , M. G. Faux , S. J. Gates, , T. Hubsch , K. M. Iga , G. D. Landweber

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

In a dynamical system $(X,f)$, with $X$ a compact metric space, the chain components, the fundamental building blocks in the Conley decomposition of dynamics, have a natural partial order induced by the chain relation between points.…

Dynamical Systems · Mathematics 2026-03-31 P. Cintioli , A. Della Corte , M. Farotti

In this work we study arrangements of $k$-dimensional subspaces $V_1,\ldots,V_n \subset \mathbb{C}^\ell$. Our main result shows that, if every pair $V_{a},V_b$ of subspaces is contained in a dependent triple (a triple $V_{a},V_b,V_c$…

Combinatorics · Mathematics 2014-12-03 Zeev Dvir , Guangda Hu

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

Let $S\_{N}(P)$ be the poset obtained by adding a dummy vertex on each diagonal edge of the $N$'s of a finite poset $P$. We show that $S\_{N}(S\_{N}(P))$ is $N$-free. It follows that this poset is the smallest $N$-free barycentric…

Discrete Mathematics · Computer Science 2007-05-23 Maurice Pouzet , Nejib Zaguia