Related papers: Intersection statistics for antichains in minuscul…
In this paper, we propose an approximate projected consensus algorithm for a network to cooperatively compute the intersection of convex sets. Instead of assuming the exact convex projection proposed in the literature, we allow each node to…
A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
We introduce a new family of finite posets which we call 2-chains. These first arose in the study of 0-Hecke algebras, but they admit a variety of different characterisations. We give these characterisations, prove that they are equivalent…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…
A poset $P$ is said to satisfy the finite antichain condition, or FAC for short, if it has no infinite antichain. It was conjectured by Aharoni and Korman in 1992 that any FAC poset $P$ possesses a chain $C$ and a partition into antichains…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
We study the following natural arithmetic question regarding intersecting families: how large can a family of subsets of integers from $\{1, \ldots n\}$ be such that, for every pair of subsets in the family, the intersection contains a sum…
We say that a poset $Q$ contains a copy (resp.~an induced copy) of a poset $P$ if there is an injection $f : P \to Q$ such that for any $x,y \in P$, $f(x)\leq f(y)$ in $Q$ if (resp.~if and only if) $x\leq y$ in $P$. Let $\mathcal{Q}=\{Q_{n}…
We compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…
We present two results on maximal antichains in the strict chain product poset $[t_1+1]\times[t_2+1]\times\ldots\times[t_n+1]$. First, we prove that these maximal antichains are also maximum. Second, we prove that there is a bijection…
Let $\Gamma\subseteq\text{PSL}(2, \mathbb{R})$ correspond to the group of units of norm $1$ in an Eichler order $\mathrm{O}$ of an indefinite quaternion algebra over $\mathbb{Q}$. Closed geodesics on $\Gamma\backslash\mathbb{H}$ correspond…
A generalization of the formula of Fine and Rao for the ranks of the intersection homology groups of a complex algebraic variety is given. The proof uses geometric properties of intersection homology and mixed Hodge theory.
The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd\H{o}s-Ko-Rado theorem. Such intersecting families, also known as constant-weight anticodes in coding…
Let $[n]:=\lbrace 1,2,\ldots,n \rbrace$, and $M$ be a set of positive integers. Denote the family of all subsets of $[n]$ with sizes in $M$ by $\binom{\left[n\right]}{M}$. The non-empty families…
Shape-dependent universal crossing probabilities are studied, via Monte Carlo simulations, for bond and site directed percolation on the square lattice in the diagonal direction, at the percolation threshold. Since the system is strongly…
We consider two mixed curve $C,C'\subset {\Bbb C}^2$ which are defined by mixed functions of two variables $\bf z=(z_1,z_2)$. We have shown in \cite{MC}, that they have canonical orientations. If $C$ and $C'$ are smooth and intersect…