Related papers: A method to construct generalized balanced tournam…
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…
A tournament $T$ is a tournament completion of a bipartite tournament $D$ if $D$ is a spanning subdigraph of $T$, i.e., $V(D)=V(T)$ and $A(D)\subseteq A(T)$. If $C$ is a $k$-dicycle (i.e., directed cycle of length $k$) in a tournament…
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes…
A Golomb ruler is a sequence of integers whose pairwise differences, or equivalently pairwise sums, are all distinct. This definition has been generalized in various ways to allow for sums of h integers, or to allow up to g repetitions of a…
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…
In recent years a new class of symmetric-key primitives over $\mathbb{F}_p$ that are essential to Multi-Party Computation and Zero-Knowledge Proofs based protocols have emerged. Towards improving the efficiency of such primitives, a number…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
Many applications, e.g. in content recommendation, sports, or recruitment, leverage the comparisons of alternatives to score those alternatives. The classical Bradley-Terry model and its variants have been widely used to do so. The…
This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for…
We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed family of tournaments grounded over simply disconnected tournaments, those tournaments whose…
We discuss building models for nucleon generalized parton distributions (GPDs) H and E that are based on the formalism of double distributions (DDs). We found that the usual "DD+D-term" construction should be amended by an extra term, \xi…
A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where…
A homogeneous tournament is a tournament with $4t+3$ vertices such that every arc is contained in exactly $t+1$ cycles of length $3$. Homogeneous tournaments are the first class of tournaments that are proved to be path extendable, which…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…
We study billiards on polytopes in $\Rr^d$ with contracting reflection laws, i.e. non-standard reflection laws that contract the reflection angle towards the normal. We prove that billiards on generic polytopes are uniformly hyperbolic…
We generalize the following simple geometric fact: the only centrally symmetric convex curve of constant width is a circle. Billiard interpretation of the condition of constant width reads: a planar curve has constant width, if and only if,…
In this paper, we completely characterize the $m$-step competition graph of a bipartite tournament for any integer $m \ge 2$. In addition, we compute the competition index and the competition period of a bipartite tournament.
We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based…
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n;m, where m ? n,…