Related papers: Characteristic Polynomial Patterns in Difference S…

Let $\mathbf{G}$ be the set of all finite or infinite increasing sequences of positive integers beginning with 1. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{G},$ a positive number $N$ is called an exponentially $S$-number $(N\in…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

For integers $k\geq 3,d\geq 2,$ we consider the abundance property of pinned $k$-point patterns occurring in $E\subseteq \mathbb R^d$ with positive upper density $\delta(E)$. We show that for any fixed $k$-point pattern $V$, there is a set…

For any closed $K\subseteq\mathbb{R}^n$, in [P.\ J.\ di\,Dio, K.\ Schm\"udgen: $K$-Positivity Preserver and their Generators, SIAM J.\ Appl.\ Algebra Geom.\ 9 (2025), 794--824] all $K$-positivity preserver have been characterized, i.e., all…

By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…

A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

We generalize the concept of the symmetric hyperdeterminants for symmetric tensors to the E-determinants for general tensors. We show that the E-determinant inherits many properties of the determinant of a matrix. These properties include:…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…