Related papers: General lower bounds on maximal determinants of bi…

The determinants of $\{\pm 1\}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on…

This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…

We prove Gaussian upper and lower bounds for the fundamental solutions of a class of degenerate parabolic equations satisfying a weak Hormander condition. The bound is independent of the smoothness of the coefficients and generalizes…

We extend several relative perturbation bounds to Hermitian matrices that are possibly singular, and also develop a general class of relative bounds for Hermitian matrices. As a result, corresponding relative bounds for singular values of…

In this short note we construct codes of length $4n$ with $8n+8$ codewords and minimum distance $2n-2$ whenever $4n+4$ is the order of a Hadamard matrix. This generalises work of Constantine who obtained a similar result in the special case…

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…

Let $p(z)=z^n+a_{n-1}z^{n-1}+a_{n-2}z^{n-2}+\ldots+a_1z+a_0$ be a complex polynomial with $a_0\neq 0$ and $n\geq 3$. Several new upper bounds for the moduli of the zeros of $p$ are developed. In particular, if…

Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg)…

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

We obtain a lower bound for the Lyapunov exponent of a family of discrete Schr\"{o}dinger operators $(Hu)_n=u_{n+1}+u_{n-1}+2a_1\cos2\pi(\theta+n\alpha)u_n+2a_2\cos4\pi(\theta+n\alpha)u_n$, that incorporates both $a_1$ and $a_2,$ thus going…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

We show that the apolar ideal to the determinant of a generic symmetric matrix is generated in degree two, and the apolar ideal to the permanent of a generic symmetric matrix is generated in degrees two and three. In each case we specify…

Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…

For p=1 (mod 4), we prove the formula (conjectured by R. Chapman) for the determinant of the matrix C with C(i,j)=LegendreSymbol(j-i,p), i,j=0,...,(p-1)/2.

We improve by an exponential factor the lower bound of Korner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has degree 4. The improvement is…

We settle a conjecture by Bik and Marigliano stating that the degree of a one-dimensional discrete model with rational maximum likelihood estimator is bounded above by a linear function in the size of its support, therefore showing that…

Let $O$ be a discrete valuation ring and $A := O[X_{m \times n}]/I_{m}(X)$ the determinantal ring of maximal minors. We consider algebra maps $\lambda \colon A \to O$, which is tantamount to choosing rank-deficient matrices $a \in O^{m…