Related papers: A weak version of Rota's basis conjecture for odd …
There is the classical Radon theorem. Given integer $d \geq 1$ and $d+2$ points in d-dimensional space $R^d$. Then these points can be divided into two disjoint subsets whose convex hulls have a non-empty intersection. The original proof of…
In 1782, Euler conjectured that no Latin square of order $n\equiv 2\; \textrm{mod}\; 4$ has a decomposition into transversals. While confirmed for $n=6$ by Tarry in 1900, Bose, Parker, and Shrikhande constructed counterexamples in 1960 for…
Quadratic descent of hermitian and skew hermitian forms over division algebras with involution of the first kind in arbitrary characteristic is investigated and a criterion, in terms of systems of quadratic forms, is obtained. A refined…
We prove that, if $B_1, \dots, B_n$ are disjoint bases of a rank-$n$ matroid, then there are at least $\lfloor{\frac{n}{6 \lceil{\log n}\rceil}}\rfloor$ disjoint transversals of $(B_1, \dots, B_n)$ that are also bases.
We establish a weak form of Ennola's conjecture. We achieve this by showing that two main assumptions Louboutin made in his previous work hold true. These assumptions are about Laurent polynomials over the rationals, and we prove them by…
An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an $n\times n$ array is a selection of $n$ different symbols from different rows and different…
A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length $n$ and minimum distance $n-1$. When such codes of length $p+1$ are included as…
Rota's basis conjecture, open since 1989, states that if B_1, B_2, ..., B_n are n bases of a vector space of rank n, then there is an nxn grid of vectors such that the vectors in the ith row are precisely the elements of B_i and such that…
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…
Las Vergnas Cube Conjecture states that the cube matroid has exactly one class of orientations. We prove that this conjecture is equivalent to saying that the oriented matroid of the affine dependencies of the n-cube can be reconstructed…
We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order~11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order $n$…
Given the space $V={\mathbb P}^{\binom{d+n-1}{n-1}-1}$ of forms of degree $d$ in $n$ variables, and given an integer $\ell>1$ and a partition $\lambda$ of $d=d_1+\cdots+d_r$, it is in general an open problem to obtain the dimensions of the…
A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of…
For several objects of interest in geometric complexity theory, namely for the determinant, the permanent, the product of variables, the power sum, the unit tensor, and the matrix multiplication tensor, we introduce and study a fundamental…
Motivated by the problems raised by B\"{u}rgisser and Ikenmeyer, we discuss two classes of minimal generic fundamental invariants for tensors of order 3. The first one is defined on $\otimes^3 \mathbb{C}^m$, where $m=n^2-1$. We study its…
Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…
In the presence of large extra dimensions, the fundamental Planck scale can be much lower than the apparent four-dimensional Planck scale. In this setup, the weak gravity conjecture implies a much more stringent constraint on the UV cutoff…
Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…
We consider the existence of robust strange nonchaotic attractors (SNA's) in a simple class of quasiperiodically forced systems. Rigorous results are presented demonstrating that the resulting attractors are strange in the sense that their…
We compute the transgressed forms of some modularly invariant characteristic forms,which are related to the twisted elliptic genera. We study the modularity properties of these secondary characteristic forms and relations among them. We…