Related papers: Polynomial parametrizations of length $4$ B\"uchi …
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
We identify all non-splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$, which admit at most four irreducible divisors. There is an infinite number of such divisors.
For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…
Given a natural number $n \geq 4$ we show that there exists infinitely many polynomials $f_{n}(x):= \prod_{i=1}^{n} (x^{2} - a_{i})$ such that (i) $f_{n}(x)$ has a root modulo every positive integer, (ii) $f_{n}(x)$ has no rational roots,…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…
The 4IM+1CM problem is determining all pairs (f,g) of meromorphic functions in the complex plane that are not Moebius transformations of each other and share five pairs of complex values, one of them counting multiplicities. It is shown…
We give a complete characterization of those $f: [0,1] \to X$ (where $X$ is a Banach space which admits an equivalent Fr\'echet smooth norm) which allow an equivalent $C^2$ parametrization. For $X=\R$, a characterization is well-known.…
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
The paper studies families of positive solution curves for non-autonomous two-point problems \[ u"+\lambda f(u)-\mu g(x)=0, \;\; -1<x<1, \;\; u(-1)=u(1)=0 \] depending on two positive parameters $\lambda$ and $\mu$. We regard $\lambda$ as a…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
It is well known that Pythagorean triples can be parametrized by two triples of polynomials with integer coefficients. We show that no single triple of polynomials with integer coefficients in any number of variables is sufficient, but that…
We study the following problem. Given a multiset $M$ of non-negative integers, decide whether there exist and, in the positive case, compute two non-trivial multisets whose Minkowski sum is equal to $M$. The Minkowski sum of two multisets A…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
A set of vertices $W$ in a graph $G$ is called resolving if for any two distinct $x,y\in V(G)$, there is $v\in W$ such that ${\rm dist}_G(v,x)\neq{\rm dist}_G(v,y)$, where ${\rm dist}_G(u,v)$ denotes the length of a shortest path between…
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…