Related papers: Is the Symmetric Group Sperner?
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality)…
Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…
In this paper we investigate the minimum number of maximal subgroups H_i for i=1 ...k of the symmetric group S_n (or the alternating group A_n) such that each element in the group S_n (respectively A_n) lies in some conjugate of one of the…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T, of order…
In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We obtain a higher dimensional analogue of a classical theorem which states that a polygonally cellulated $2$-sphere in $\mathbb{R}^3$, such that each vertex has even degree, is $2$-face-colourable. In order to formulate our result, we…
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…
The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. Let $\mathcal{P}_n$ be the set of all the subset $S\subseteq [n]$ such that there exists a permutation $\sigma$ which has the…
In this paper we show that for any poset $P$ that is not an antichain, the number of induced $P$-free families in the Boolean lattice $2^{[n]}$ is at most $ 2^{O(\mathrm{La}^*(n,P))}$, where $\mathrm{La}^*(n,P)$ denotes the the largest size…
The height of a poset $P$ is the supremum of the cardinalities of chains in $P$. The exact formula for the height of the subgroup lattice of the symmetric group $\mathcal{S}_n$ is known, as is an accurate asymptotic formula for the height…
The set D_n of all difunctional relations on an n element set is an inverse semigroup under a variation of the usual composition operation. We solve an open problem of Kudryavtseva and Maltcev (2011), which asks: What is the rank (smallest…
Subgroups of the symmetric group $S_n$ act on powers of chains $C^n$ by permuting coordinates, and induce automorphisms of the ordered sets $C^n$. The quotients defined are candidates for symmetric chain decompositions. We establish this…
We show that, for $pn \to \infty$, the largest set in a $p$-random sub-family of the power set of $\{1, \ldots, n\}$ containing no $k$-chain has size $( k - 1 + o(1) ) p \binom{n}{n/2}$ with high probability. This confirms a conjecture of…
Motivated by the recently introduced concept of a pseudosymmetric braided monoidal category, we define the pseudosymmetric group PS_n, as the quotient of the braid group B_n by the relations \sigma_i\sigma_{i+1}^{-1}\sigma_i=\sigma…
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
An antichain of subsets is a set of subsets such that no subset in the antichain is a proper subset of any other subset in the antichain. The Dedekind number counts the total number of antichains of subsets of an n-element set. This paper…