Related papers: Nonsequenceable Steiner triple systems
A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…
We show that under certain assumptions one can derive a variant of Specker's non-contextual inequality for a system of three indistinguishable bosonic particles. The inequality states that the sum of probabilities of three pairwise…
The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…
In this paper, the problem of partial stabilization of nonlinear systems along a given trajectory is considered. This problem is treated within the framework of stability of a family of sets. Sufficient conditions for the asymptotic…
The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
The pasch configuration and Steiner triple systems
The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…
The separability and entanglement of quantum mixed states in $\Cb^2 \otimes \Cb^3 \otimes \Cb^N$ composite quantum systems are investigated. It is shown that all quantum states $\rho$ with positive partial transposes and rank $r(\rho)\leq…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…
Whereas Steiner systems $S(2,k,v)$ with block length $k \le 5$ have large amount of examples and the existence is established for all admissible $v$, for $k\ge 6$ only few examples are known even for decided cases. In this paper the…
An integer $n$ is said to be ternary if it is composed of three distinct odd primes. In this paper, we asymptotically count the number of ternary integers $n \leq x$ with the constituent primes satisfying various constraints. We apply our…
We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.
A countable dense set of directions is sufficient for Steiner symmetrization, but the order of directions matters.
By a famous result of Doyen, Hubaut and Vandensavel \cite{DHV}, the 2-rank of a Steiner triple system on $2^n-1$ points is at least $2^n -1 -n$, and equality holds only for the classical point-line design in the projective geometry…