相关论文: Antichain cutsets in real-ranked lattices

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice…

We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…

We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an…

The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $ X \times (V(G)\setminus X)$ matrix over the binary field whose $(i,j)$-entry is $1$ if the vertex $i$ in $X$ is adjacent to the vertex $j$ in…

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

We study maximum antichains in two posets related to quiver representations. Firstly, we consider the set of isomorphism classes of indecomposable representations ordered by inclusion. For various orientations of the Dynkin diagram of type…

An $\mathbb R$-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying $\mathbb R$-trees be characterised by the fact that…

Here, in every simple finite-dimensional vectorial Lie superalgebra considered with the standard grading where every indeterminate is of degree 1, the maximal graded solvable subalgebras are classified over $\mathbb{C}$.

In this paper, we presented a novel semi-supervised one-class classification algorithm which assumes that class is linearly separable from other elements. We proved theoretically that class is linearly separable if and only if it is maximal…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices.…

We define noncrossing partitions of a marked surface without punctures (interior marked points). We show that the natural partial order on noncrossing partitions is a graded lattice and describe its rank function topologically. Lower…

For massive and heterogeneous modern datasets, it is of fundamental interest to provide guarantees on the accuracy of estimation when computational resources are limited. In the application of learning to rank, we provide a hierarchy of…

We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…

The global structure of the unbounded derived category of a truncated polynomial ring on countably many generators is investigated, via its Bousfield lattice. The Bousfield lattice is shown to have cardinality larger than that of the real…