Related papers: Polynomial parametrizations of length $4$ B\"uchi …

The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…

We study SU(2) BPS monopoles with spectral curves of the form $\eta^3+\chi(\zeta^6+b \zeta^3-1)=0$. Previous work has has established a countable family of solutions to Hitchin's constraint that $L^2$ was trivial on such a curve. Here we…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

We determine all modular curves $X_0(N)$ with infinitely many quartic points. To do this, we define a pairing that induces a quadratic form representing all possible degrees of a rational morphism from $X_0(N)$ to a positive rank elliptic…

We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…

In this article we investigate the algebra $U_q^+(B_2)$. Assume that $q$ is a primitive $m$-th root of unity with $m \geq 5$. We prove that $U_q^+(B_2)$ becomes a Polynomial Identity (PI) algebra. It was previously known that for such…

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

We prove that for every positive integer $m$, there exist infinitely many simple abelian varieties over $\mathbb{F}_2$ of order $m$. The method is constructive, building on the work of Madan--Pal in the case $m=1$ to produce an explicit…

Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…

Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence…

We give a complete characterization of the parity of $b_8(n)$, the number of $8$-regular partitions of $n$. Namely, we prove that $b_8(n)$ is odd or even depending on whether or not we have the factorisation $24n+7=p^{4a+1}m^2$, for some…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

We study the set $M$ of all multiplicities of non-zero eigenvalues for the Laplace operator on a two-dimensional rectangle or torus. We show that for a rectangle with the side length ratio $r$, $M=\mathbb{N}$, the set of all positive…

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…

Solving integer programs of the form $\min \{\mathbf{x} \mid A\mathbf{x} = \mathbf{b}, \mathbf{l} \leq \mathbf{x} \leq \mathbf{u}, \mathbf{x} \in \mathbb{Z}^n \}$ is, in general, $\mathsf{NP}$-hard. Hence, great effort has been put into…

This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=det(M), and where each entry of M is either a constant or a…