English
Related papers

Related papers: Relative blocking in posets

200 papers

Rationals are known to form interesting and computationally rich structures, such as Farey sequences and infinite trees. Little attention is being paid to more general, systematic exposition of the basic properties of fractions as a set.…

Number Theory · Mathematics 2015-07-15 Boyko B. Bantchev

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

Geometric Topology · Mathematics 2018-08-31 Sergey A. Melikhov

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…

Combinatorics · Mathematics 2015-04-07 S. Nkonkobe , V. Murali

For an algebraic stack $\sX$ flat and of finite presentation over a scheme $S$, we introduce various notions of {\em relative connected components} and {\em relative irreducible components}. The main distinction between these notions is…

Algebraic Geometry · Mathematics 2010-02-18 Matthieu Romagny

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

Combinatorics · Mathematics 2007-05-23 Jonathan David Farley

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

Computational Complexity · Computer Science 2012-08-15 Ville Salo , Ilkka Törmä

In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.

General Topology · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…

Combinatorics · Mathematics 2016-08-25 Dániel T. Nagy

The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…

Combinatorics · Mathematics 2017-10-17 Dmitri I. Panyushev

In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…

General Mathematics · Mathematics 2023-07-03 Omprakash Atale

We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…

Combinatorics · Mathematics 2015-08-05 Yan X. Zhang

We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. Starting from ZFC, the exposition in this first part includes relation and order theory as well as a construction of…

History and Overview · Mathematics 2013-06-26 Felix Nagel

We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our construction generalizes a recent result of Dvir and Lovett…

Computational Complexity · Computer Science 2012-03-21 Zeev Dvir , János Kollár , Shachar Lovett

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

Representation Theory · Mathematics 2015-02-12 M. Domokos

The consecutive pattern poset is the infinite partially ordered set of all permutations where $\sigma\le\tau$ if $\tau$ has a subsequence of adjacent entries in the same relative order as the entries of $\sigma$. We study the structure of…

Combinatorics · Mathematics 2019-05-27 Sergi Elizalde , Peter R. W. McNamara

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

Group Theory · Mathematics 2014-05-07 M. Shahryari

The relative position of one subfactor of a factor has been proved quite rich since the work of Jones. We shall show that the theory of relative position of several subspaces of a separable infinite-dimensional Hilbert space is also rich.…

Operator Algebras · Mathematics 2007-05-23 Masatoshi Enomoto , Yasuo Watatani

We introduce a new partial order on the set of all antichains of a fixed size in any poset. When applied to minuscule posets, these partial orders give rise to distributive lattices that appear in the branching rules for minuscule…

Combinatorics · Mathematics 2026-02-24 R. M. Green , Tianyuan Xu