English
Related papers

Related papers: Density property of certain sets and their applica…

200 papers

Let $PD(\mathbb{R})$ be the family of continuous positive definite functions on $\mathbb{R}$. For an integer $n>1$, a $f\in PD(\mathbb{R})$ is called $n$-divisible if there is $g\in PD(\mathbb{R})$ such that $g^n=f$. Some properties of…

Classical Analysis and ODEs · Mathematics 2022-10-10 Saulius Norvidas

<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i)…

Logic in Computer Science · Computer Science 2013-03-27 D. Cenzer , V. W. Marek , J. B. Remmel

Let K be a ring and let A be a subset of K. We say that a map f:A \to K is arithmetic if it satisfies the following conditions: if 1 \in A then f(1)=1, if a,b \in A and a+b \in A then f(a+b)=f(a)+f(b), if a,b \in A and a \cdot b \in A then…

Number Theory · Mathematics 2008-03-01 Apoloniusz Tyszka

Let $p$ be a prime number. We say that a positive integer $n$ is a Sylow $p$-number if there exists a finite group having exactly $n$ Sylow $p$-subgroups. When $p=2$, every odd integer is a Sylow $2$-number. In contrast, when $p$ is odd,…

Group Theory · Mathematics 2025-12-30 Andrea Lucchini , Pablo Spiga

Given a smooth function f on R^n and a submanifold M, we prove that the set of diagonal quadratic forms q such that the restriction of f+q to M is Morse is a dense set (in the n-dimensional space of diagonal quadratic forms). The standard…

Differential Geometry · Mathematics 2011-11-17 Antonio Lerario

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

Number Theory · Mathematics 2024-08-14 Deepa Antony , Rupam Barman

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Number Theory · Mathematics 2019-08-21 David Wu

Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…

Number Theory · Mathematics 2026-03-23 Jeremy Schlitt

We prove two generalizations of Furstenberg's Diophantine result regarding density of an orbit of an irrational point in the one-torus under the action of multiplication by a non-lacunary multiplicative semi-group of $\mathbb{N}$. We show…

Dynamical Systems · Mathematics 2016-09-28 Asaf Katz

We give the first mathematically rigorous justification of the Local Density Approximation in Density Functional Theory. We provide a quantitative estimate on the difference between the grand-canonical Levy-Lieb energy of a given density…

Mathematical Physics · Physics 2019-11-13 Mathieu Lewin , Elliott H. Lieb , Robert Seiringer

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Number Theory · Mathematics 2025-10-10 Scott Ahlgren , Olivia Beckwith

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

Logic in Computer Science · Computer Science 2023-07-06 Jan Dreier , Daniel Mock , Peter Rossmanith

Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…

Formal Languages and Automata Theory · Computer Science 2021-04-13 Jason P. Bell

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

Number Theory · Mathematics 2025-07-25 Hanson Smith

The theory of uniform approximation of real numbers motivates the study of products of consecutive partial quotients in regular continued fractions. For any non-decreasing positive function $\varphi:\mathbb{N}\to [2,\infty)$, we determine…

Number Theory · Mathematics 2025-07-24 Adam Brown-Sarre , Gerardo González Robert , Mumtaz Hussain

It is a classical fact that the irrationality of a number $\xi\in\mathbb R$ follows from the existence of a sequence $p_n/q_n$ with integral $p_n$ and $q_n$ such that $q_n\xi-p_n\ne0$ for all $n$ and $q_n\xi-p_n\to0$ as $n\to\infty$. In…

Number Theory · Mathematics 2018-08-06 Wadim Zudilin

We show how different random thin sets of integers may have different behaviour. First, using a recent deviation inequality of Boucheron, Lugosi and Massart, we give a simpler proof of one of our results in {\sl Some new thin sets of…

Functional Analysis · Mathematics 2009-04-17 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

Using a central limit theorem for arrays of interacting quantum systems, we give analytical expressions for the density of states and the partition function at finite temperature of such a system, which are valid in the limit of infinite…

Statistical Mechanics · Physics 2009-11-10 Michael Hartmann , Guenter Mahler , Ortwin Hess

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…

Formal Languages and Automata Theory · Computer Science 2020-05-22 Aalok Thakkar