Related papers: A parameterized linear formulation of the integer …

In this paper, we prove Dahmen and Beukers' conjecture that the number of integral Lam\'{e} equations with index $n$ modulo scalar equivalence with the monodromy group dihedral $D_{N}$ of order $2N$ is given by \[L_{n}(N)=\frac{1}{2}\left(…

Integer linear programs $\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}$, where $A \in \mathbb{Z}^{m \times n}$, $b \in \mathbb{Z}^m$, and $c \in \mathbb{Z}^n$, can be solved in pseudopolynomial time for any fixed number of constraints…

We prove universality at the edge of the spectrum for unitary (beta=2), orthogonal (beta=1) and symplectic (beta=4) ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial,…

This paper is a study of linear spaces of matrices and linear maps on matrix algebras that arise from \emph{spin systems}, or \emph{spin unitaries}, which are finite sets $\mathcal S$ of selfadjoint unitary matrices such that any two…

We consider a unitary representation of the Dihedral group $D_{2n}% =\mathbb{Z}_{n}\rtimes\mathbb{Z}_{2}$ obtained by inducing the trivial character from the co-normal subgroup $\left\{0\right\}\rtimes\mathbb{Z}_{2}.$ This representation is…

We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the…

Feature hashing, also known as {\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely speaking, feature hashing uses a random sparse projection…

Incomplete Information research is quite mature when it comes to so called {\em existential nulls}, where an existential null is a value stored in the database, representing an unknown object. For some reason {\em universal nulls}, that is,…

Let $P_{2k}$ be a homogeneous polynomial of degree $2k$ and assume that there exist $C>0$, $D>0$ and $\alpha \ge 0$ such that \begin{equation*} \left\langle P_{2k}f_{m},f_{m}\right\rangle_{L^2(\mathbb{S}^{d-1})}\geq \frac{1}{C\left(…

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…

We give a new proof of universality properties in the bulk of spectrum of the hermitian matrix models, assuming that the potential that determines the model is globally $C^{2}$ and locally $C^{3}$ function (see Theorem \ref{t:U.t1}). The…

We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e.…

We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an…

Given two unital C*-algebras $A$ and $B$, we study, when it exists, the universal unital $C^*$-algebra $\mathcal{U}(A,B)$ generated by the coefficients of a unital $*$-homomorphism $\rho\,:\, A\rightarrow B\otimes\mathcal{U}(A,B)$. When $B$…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

The column number question asks for the maximal number of columns of an integer matrix with the property that all its rank size minors are bounded by a fixed parameter $\Delta$ in absolute value. Polynomial upper bounds have been proved in…

We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number $n$ of variables, the number $m$ of constraints, and $1/\delta$, where $\delta$ is a parameter that…

Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…

The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…

This paper considers some work done by the author and Catlin [CD1,CD2,CD3] concerning positivity conditions for bihomogeneous polynomials and metrics on bundles over certain complex manifolds. It presents a simpler proof of a special case…