Related papers: A Purely Combinatorial Approach to Simultaneous Po…

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…

We address the problem of constructing approximations based on orthogonal polynomials that preserve an arbitrary set of moments of a given function without loosing the spectral convergence property. To this aim, we compute the constrained…

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…

We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of…

We study structures of derivation modules of Coxeter multiarrangements with quasi-constant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with…

There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{n\|n\alpha-\gamma\|}~~~\text{and}~~~ R_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{\|n\alpha-\gamma\|}\,, \] where…

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

We show that the parabola is of strong Khintchine type for convergence, which is the first result of its kind for curves. Moreover, Jarnik type theorems are established in both the simultaneous and the dual settings, without monotonicity on…

We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…

We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…