English
Related papers

Related papers: Representation of powers by polynomials over funct…

200 papers

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…

Mathematical Physics · Physics 2024-08-08 Emil Horozov , Boris Shapiro , Milos Tater

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

Number Theory · Mathematics 2014-08-07 Cristina Ballantine , Mircea Merca

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

Group Theory · Mathematics 2020-12-21 A. Yu. Olshanskii , M. V. Sapir

We show that the existential fragment of B\"uchi arithmetic is strictly less expressive than full B\"uchi arithmetic of any base, and moreover establish that its $\Sigma_2$-fragment is already expressively complete. Furthermore, we show…

Logic in Computer Science · Computer Science 2021-03-04 Christoph Haase , Jakub Różycki

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

Number Theory · Mathematics 2018-01-23 Bo-Hae Im , Michael Larsen

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

Logic in Computer Science · Computer Science 2015-07-01 Anuj Dawar , Eryk Kopczynski , Bjarki Holm , Erich Grädel , Wied Pakusa

In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki,…

Logic · Mathematics 2023-08-11 Natalia Garcia-Fritz , Hector Pasten

We consider the problem of representation of a bivariate function by sums of ridge functions. We show that if a function of a certain smoothness class is represented by a sum of finitely many, arbitrarily behaved ridge functions, then it…

Classical Analysis and ODEs · Mathematics 2016-06-28 Rashid Aliev , Vugar Ismailov

Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field~$\mathbb{F}_{q^n}$ considered as a linear space…

Number Theory · Mathematics 2019-07-05 László Mérai

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…

Algebraic Geometry · Mathematics 2021-10-26 I. Nikitin

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

Probability · Mathematics 2010-08-13 Wolfgang Karcher , Hans-Peter Scheffler , Evgeny Spodarev

We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the…

Logic in Computer Science · Computer Science 2007-05-23 Frank Wolter , Michael Zakharyaschev

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Number Theory · Mathematics 2017-09-19 Amalaswintha Wolfsdorf

It is known that infinitely many number fields and function fields of any degree $m$ have class number divisible by a given integer $n$. However, significantly less is known about the indivisibility of class numbers of such fields. While…

Number Theory · Mathematics 2009-06-22 Michael Daub , Jaclyn Lang , Mona Merling , Allison M. Pacelli , Natee Pitiwan , Michael Rosen

The study is made of the problem of multiple interpolation on an infinite nodes set by the sums of absolutely convergent series of exponentials whose exponents are from a given set. For entire function conditions on nodes and exponents are…

Complex Variables · Mathematics 2018-10-02 Sergey Georgievich Merzlyakov , Sergey Victorovich Popenov

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

B\"uchi's problem asks whether there exists a positive integer $M$ such that any sequence $(x_n)$ of at least $M$ integers, whose second difference of squares is the constant sequence $(2)$, satisifies $x_n^2=(x+n)^2$ for some $x\in\Z$. A…

Number Theory · Mathematics 2010-08-19 Xavier Vidaux