Related papers: A method to construct generalized balanced tournam…
We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations…
Let $q$ be a fixed odd prime. We show that a finite subset $B$ of integers, not containing any perfect $q^{th}$ power, contains a $q^{th}$ power modulo almost every prime if and only if $B$ corresponds to a blocking set (with respect to…
Let $p$ be a prime number, $k$ an algebraically closed field of characteristic $p$, $\tilde{G}$ a finite group, and $G$ a normal subgroup of $\tilde{G}$ having a $p$-power index in $\tilde{G}$. Moreover let $B$ be a block of $kG$ with a…
Given $k$ pairs of vertices $(s_i,t_i)\;(1\le i\le k)$ of a digraph $G$, how can we test whether there exist vertex-disjoint directed paths from $s_i$ to $t_i$ for $1\le i\le k$? This is NP-complete in general digraphs, even for $k = 2$,…
Tensors are ubiquitous in science and engineering and tensor factorization approaches have become important tools for the characterization of higher order structure. Factorizations includes the outer-product rank Canonical Polyadic…
A mixed dominating set $S$ of a graph $G=(V,E)$ is a subset $ S \subseteq V \cup E$ such that each element $v\in (V \cup E) \setminus S$ is adjacent or incident to at least one element in $S$. The mixed domination number $\gamma_m(G)$ of a…
This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…
The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We…
Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…
Harmonic maps from $\BR^2$ or one-connected domain ${\O}\subset \BR^2$ into $GL(m, \BC)$ and $U(m)$ are treated. The GBDT version of the B\"acklund-Darboux transformation is applied to the case of the harmonic maps. A new general formula on…
We prove the following new results. (a) Let $T$ be a regular tournament of order $2n+1\geq 11$ and $S$ a subset of $V(T)$. Suppose that $|S|\leq \frac{1}{2}(n-2)$ and $x$, $y$ are distinct vertices in $V(T)\setminus S$. If the subtournament…
This paper considers two closely related concepts, mixed Steiner system and nonuniform group divisible design (GDD). The distinction between the two concepts is the minimum Hamming distance, which is required for mixed Steiner systems but…
When all the elements of the multiset $\{1,1,2,2,3,3,\ldots,k,k\}$ are placed in the cells of a $2\times k$ rectangular array, in how many configurations are exactly $v$ of the pairs directly over top one another, and exactly $h$ directly…
In a scenario where the constituent quarks are composite systems, Generalized Parton Distributions (GPDs) are built from wave functions to be evaluated in a Constituent Quark Model (CQM), convoluted with the GPDs of the constituent quarks…
Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…
The balanced incomplete block design (BIBD) problem is a difficult combinatorial problem with a large number of symmetries, which add complexity to its resolution. In this paper, we propose a dual (integer) problem representation that…
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a measure of how far is the tournament from being acyclic. The degreewidth of a tournament $T$ denoted by $\Delta(T)$ is the minimum value $k$…