Related papers: Hadamard Matrix Torsion

We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in…

For even $k$, the matchings connectivity matrix $\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al. (STOC 2013) showed that the rank of $\mathbf{M}_k$ over $\mathbb{Z}_2$ is…

Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them. In particular, we…

We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection $\P$ of $k$ convex polyhedra in $\reals^3$ with a total of $n$ facets, and present a…

We study a class of time-dependent (TD) non-Hermitian Hamiltonians $H(t)$ that can be transformed into a time-independent pseudo-Hermitian Hamiltonian $\mathcal{H}_{0}^{PH}$ using a suitable TD unitary transformation $F(t)$. The latter can…

We consider the problem of preprocessing an $n\times n$ matrix $\mathbf{M}$, and supporting queries that, for any vector $v$, returns the matrix-vector product $\mathbf{M} v$. This problem has been extensively studied in both theory and…

Let $\mathbf{A}\in \mathbb{R}^{n\times n}$ be a matrix with diagonal $\text{diag}(\mathbf{A})$ and let $\bar{\mathbf{A}}$ be $\mathbf{A}$ with its diagonal set to all zeros. We show that Hutchinson's estimator run for $m$ iterations returns…

We consider generic degenerate subvarieties $X_i\subset\mathbb{P}^n$. We determine an integer $N$, depending on the varieties, and for $n\geq N$ we compute dimension and degree formulas for the Hadamard product of the varieties $X_i$.…

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

\textit{Propus} (which means twins) is a construction method for orthogonal $\pm 1$ matrices based on a variation of the Williamson array called the \textit{propus array} \[ \begin{matrix*}[r] A& B & B & D B& D & -A &-B B& -A & -D & B D& -B…

We construct sphere fibrations over $(n-1)$-connected $2n$-manifolds such that the total space is a connected sum of sphere products. More precisely, for $n$ even, we construct fibrations $S^{n-1} \to \#^{k-1}(S^n \times S^{2n-1}) \to M_k$,…

We establish for $2 \le k \le n-1$ the strict concavity of the function $f_k(\lambda)=\log(\sigma_k(\lambda))$ on a subset of the positive cone $\Gamma_n=\{\lambda=(\lambda_{1}, \lambda_{2}, \cdots,\lambda_{n})\in \mathbb{R}^n;…

We investigate the existence and properties of a double asymptotic expansion in $1/N^{2}$ and $1/\sqrt{D}$ in $\mathrm{U}(N)\times\mathrm{O}(D)$ invariant Hermitian multi-matrix models, where the $N\times N$ matrices transform in the vector…

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

In this computational paper we verify a truncated version of the Buzzard-Calegari conjecture on the Newton polygon of the Hecke operator $T_2$ for all large enough weights. We first develop a formula for computing $p$-adic valuations of…

We give constructions of n^k x n^k x n tensors of rank at least 2n^k - O(n^(k-1)). As a corollary we obtain an [n]^r shaped tensor with rank at least 2n^(r/2) - O(n^(r/2)-1) when r is odd. The tensors are constructed from a simple recursive…

In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard matrices modulo 5. We prove that there exist 5-modular Hadamard matrices of order n if and only if n != 3, 7 (mod 10) or n != 6, 11. In…

Relative Heffter arrays, denoted by $\mathrm{H}_t(m,n; s,k)$, have been introduced as a generalization of the classical concept of Heffter array. A $\mathrm{H}_t(m,n; s,k)$ is an $m\times n$ partially filled array with elements in…

For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of…

A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…