English
Related papers

Related papers: On small bases for which $1$ has countably many ex…

200 papers

In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…

General Mathematics · Mathematics 2024-12-17 Vorashil Farzaliyev

We consider an analogue of Nakada's $\alpha$-continued fraction transformation in the setting of continued fractions with odd partial quotients. More precisely, given $\alpha \in [\frac{1}{2}(\sqrt{5}-1),\frac{1}{2}(\sqrt{5}+1)]$, we show…

Dynamical Systems · Mathematics 2019-07-03 Florin P. Boca , Claire Merriman

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

This paper is about the positive part $U_q^+$ of the $q$-deformed enveloping algebra $U_q(\widehat{\mathfrak{sl}}_2)$. The literature contains at least three PBW bases for $U_q^+$, called the Damiani, the Beck, and the alternating PBW…

Quantum Algebra · Mathematics 2023-05-19 Chenwei Ruan

For Lebesgue generic $(x_1,x_2)\in \mathbb{R}^2$, we investigate the distribution of small values of products $q\cdot \|qx_1\| \cdot \|qx_2\|$ with $q\in\mathbb{N}$, where $\|\cdot \|$ denotes the distance to the closest integer. The main…

Number Theory · Mathematics 2023-11-22 Michael Björklund , Reynold Fregoli , Alexander Gorodnik

Let $\cC$ be a smooth absolutely irreducible curve of genus $g \ge 1$ defined over $\F_q$, the finite field of $q$ elements. Let $# \cC(\F_{q^n})$ be the number of $\F_{q^n}$-rational points on $\cC$. Under a certain multiplicative…

Number Theory · Mathematics 2010-03-15 Omran Ahmadi , Igor E. Shparlinski

Let $n\geq 2$ and $1\leq q<p<\fz$. We prove that if $\Omega\subset\mathbb R^n$ is a Sobolev $(p, q)$-extension domain, with additional capacitory restrictions on boundary in the case $q\leq n-1$, $n>2$, then $|\partial\Omega|=0$. In the…

Analysis of PDEs · Mathematics 2020-12-15 Pekka Koskela , Alexander Ukhlov , Zheng Zhu

We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…

Combinatorics · Mathematics 2018-06-18 Julien Leroy , Michel Rigo , Manon Stipulanti

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

General Mathematics · Mathematics 2025-09-30 N. A. Carella

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Number Theory · Mathematics 2018-11-29 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

Famous Zaremba's conjecture (1971) states that for each positive integer $q\geq2$, there exists positive integer $1\leq a <q$, coprime to $q$, such that if you expand a fraction $a/q$ into a continued fraction $a/q=[a_1,\ldots,a_n]$, all of…

Number Theory · Mathematics 2023-10-20 Nikita Shulga

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

Number Theory · Mathematics 2021-11-30 Marco Aymone

The length function $\ell_q(r,R)$ is the smallest length of a $ q $-ary linear code with codimension (redundancy) $r$ and covering radius $R$. In this work, new upper bounds on $\ell_q(tR+1,R)$ are obtained in the following forms:…

Information Theory · Computer Science 2021-11-30 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We study the set of the representable numbers in base $q=pe^{i\frac{2\pi}{n}}$ with $\rho>1$ and $n\in \mathbb N$ and with digits in a arbitrary finite real alphabet $A$. We give a geometrical description of the convex hull of the…

Number Theory · Mathematics 2011-05-24 Anna Chiara Lai

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| >…

Combinatorics · Mathematics 2018-11-15 Brendan Murphy , Giorgis Petridis

A Trott number is a number $x\in(0,1)$ whose continued fraction expansion is equal to its base $b$ expansion for a given base $b$, in the following sense: If $x=[0;a_1,a_2,\dots]$, then $x=(0.\hat{a}_1\hat{a}_2\dots)_b$, where $\hat{a}_i$…

Number Theory · Mathematics 2022-02-08 Pieter Allaart , Stephen Jackson , Taylor Jones , David Lambert

For a positive integer $M$ and a real base $q\in(1,M+1]$, let $\mathcal{U}_q$ denote the set of numbers having a unique expansion in base $q$ over the alphabet $\{0,1,\dots,M\}$, and let $\mathbf{U}_q$ denote the corresponding set of…

Dynamical Systems · Mathematics 2019-09-24 Pieter C. Allaart

For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…

Number Theory · Mathematics 2022-08-09 Ramachandran Balasubramanian , Olivier Ramaré , Priyamvad Srivastav

Let $D,Q$ be natural numbers, $(D,Q)=1$, such that $D/Q>1$ and $D/Q$ is not a square. Let $q$ be the smallest divisor of $Q$ such that $Q|\, q^2$. We show that the units $>1$ of the ring $\mathbb Z[\sqrt{Dq^2/Q}]$ are connected with certain…

Number Theory · Mathematics 2022-11-23 Kurt Girstmair

Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate, relative…

Information Theory · Computer Science 2011-07-22 Yuri I. Manin