Related papers: A note on finding large transversals efficiently
Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…
An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one…
We revisit the complexity of building, given a two-dimensional string of size $n$, an indexing structure that allows locating all $k$ occurrences of a two-dimensional pattern of size $m$. While a structure of size $\mathcal{O}(n)$ with…
This paper generalizes a recent result by the authors concerning the sum of width-one matrices; in the present work, we consider width-one tensors of arbitrary dimensions. A tensor is said to have width 1 if, when visualized as an array,…
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and…
The vertices of commuting graph of $\mathbb{R}^{n\times n}$ are non-scalar matrices; the edges are defined as pairs $(u, v)$ satisfying $uv = vu$. For $n\geqslant 3$, the diameter of this graph is at least four; we give a short proof that…
Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left((1+o(1))\frac{n}{e^2}\right)^{n}$, and conjectured that…
For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…
A word is level if each letter appears in it the same number of times, plus or minus 1. We give a complete characterization of the lengths for which level ternary circular square-free words exist. Key words: combinatorics on words, circular…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…
We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n)…
Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols.…
A spiral in $\mathbb{R}^{d+1}$ is defined as a set of the form $\left\{\sqrt[d+1]{n}\cdot\boldsymbol{u}_n\right\}_{n\ge 1},$ where $\left(\boldsymbol{u}_n\right)_{n\ge 1}$ is a spherical sequence. Such point sets have been extensively…
A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. It is known that the spectrum of $T_n$ consists of integers, but it is not known exactly how these numbers are…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses $O(n\log^{\varepsilon}n)$ bits for any $\varepsilon>0$ and reports all…
Symbolic equations are at the core of scientific discovery. The task of discovering the underlying equation from a set of input-output pairs is called symbolic regression. Traditionally, symbolic regression methods use hand-designed…