Related papers: Integer matrices with a given characteristic polyn…
We establish a superpolynomial lower bound on the range of the permanent function on the set of $n\times n$ matrices with $\pm1$ entries.
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…
We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…
Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
For each irreducible finite dimensional representation of the Lie algebra $\mathfrak{sl}_2(\mathbb{C})$ of $2\times 2$ traceless matrices, an explicit uniform upper bound is given for the multiplicities in the cocharacter sequence of the…
We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…
The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are characterized, using recursive formulas. Furthermore, the…
Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…
Let $f$ bea noncommutativepolynomial of degree $m\ge 1$ over an algebraically closed field $F$ of characteristic $0$. If $n\ge m-1$ and $\alpha_1,\alpha_2,\alpha_3$ are nonzero elements from $F$ such that $\alpha_1+\alpha_2+\alpha_3=0$,…
We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…
Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…
In this paper we prove a single exponential upper bound on the number of possible homotopy types of the fibres of a Pfaffian map, in terms of the format of its graph. In particular we show that if a semi-algebraic set $S \subset…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
We give a unified and systematic way to find bounds for the largest real eigenvalue of a nonnegative matrix by considering its modified quotient matrix. We leverage this insight to identify the unique class of matrices whose largest real…