English
Related papers

Related papers: Analysis of Width-$w$ Non-Adjacent Forms to Imagin…

200 papers

Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…

Number Theory · Mathematics 2026-01-23 Johann Verwee

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

The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the…

Combinatorics · Mathematics 2023-06-22 Tianlong Ma , Yaping Mao , Eddie Cheng , Christopher Melekian

For an infinite iterated function system $\mathbf{f}$ on $[0,1]$ with an attractor $\Lambda(\mathbf{f})$ and for an infinite subset $D\subseteq \mathbb{N}$, consider the set \[ \mathbb E(\mathbf{f},D)= \{ x \in \Lambda(\mathbf{f}):…

Dynamical Systems · Mathematics 2024-01-01 Gerardo González Robert , Mumtaz Hussain , Nikita Shulga , Hiroki Takahasi

In this thesis, we prove the existence of a secondary term for the count of cubic extensions of the function field $\mathbb{F}_q(t)$ of fixed absolute norm of discriminant. We show that the number of cubic extensions with absolute norm of…

Number Theory · Mathematics 2025-04-28 Michael Kural

Recently introduced connections between quantum codes and Narain CFTs provide a simple ansatz to express a modular-invariant function $Z(\tau,\bar \tau)$ in terms of a multivariate polynomial satisfying certain additional properties. These…

High Energy Physics - Theory · Physics 2023-06-28 Anatoly Dymarsky , Rohit R. Kalloor

The standard Universal Approximation Theorem for operator neural networks (NNs) holds for arbitrary width and bounded depth. Here, we prove that operator NNs of bounded width and arbitrary depth are universal approximators for continuous…

Machine Learning · Computer Science 2021-09-24 Annan Yu , Chloé Becquey , Diana Halikias , Matthew Esmaili Mallory , Alex Townsend

Let $p$ be a prime number and $K$ be a field with embeddings into $\mathbb{R}$ and $\mathbb{Q}_p$. We propose an algorithm that generates continued fraction expansions converging in $\mathbb{Q}_p$ and is expected to simultaneously converge…

Number Theory · Mathematics 2023-09-19 Shin-ichi Yasutomi

This paper studies a partial-fraction expansion for lossless negative imaginary systems and presents a generalized lossless negative imaginary lemma by allowing poles at zero. First, a necessary and sufficient condition for a system to be…

Optimization and Control · Mathematics 2018-08-27 Mei Liu , Gang Chen

The binary sum-of-digits function $\mathsf{s}$ returns the number of ones in the binary expansion of a nonnegative integer. Cusick's Hamming weight conjecture states that, for all integers $t\geq 0$, the set of nonnegative integers $n$ such…

Number Theory · Mathematics 2023-09-04 Bartosz Sobolewski , Lukas Spiegelhofer

We confirm the long-standing prediction that $c=e\approx 2.718$ is the threshold for the emergence of a non-vanishing absolutely continuous part (extended states) at zero in the limiting spectrum of the Erd\H{o}s-Renyi random graph with…

Probability · Mathematics 2018-09-21 Simon Coste , Justin Salez

We show that the growth rate of denominator $Q_n$ of the $n$-th convergent of negative expansion of $x$ and the rate of approximation: $$ \frac{\log{n}}{n}\log{\left|x-\frac{P_n}{Q_n}\right|}\rightarrow -\frac{\pi^2}{3} \quad \text{in…

Dynamical Systems · Mathematics 2020-05-12 Hiroaki Ito

This paper contains an algebraic constructive and self-contained account of the invariance rule of the digital root under division for an arbitrary natural basis representation. Both the cases of repeating and non-repeating fractionals are…

Number Theory · Mathematics 2021-10-11 Lucas T. Cardoso , Glauber Quadros

Let Q be an infinite set of positive integers. Denote by W(Q) the set of n-tuples of real numbers simultaneously tau-well approximable by infinitely many rationals with denominators in Q but only by finitely many rationals with denominators…

Number Theory · Mathematics 2013-08-20 Faustin Adiceam

We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…

Number Theory · Mathematics 2023-01-18 S. G. Dani , Ojas Sahasrabudhe

Motivated by the inadequacy of conducting atomistic simulations of crack propagation using static boundary conditions that do not reflect the movement of the crack tip, we extend Sinclair's flexible boundary condition algorithm [Philos.…

Computational Physics · Physics 2021-03-10 Maciej Buze , James R. Kermode

In this paper we establish properties of independence for the continued fraction expansions of two algebraic numbers. Roughly speaking, if the continued fraction expansions of two irrational algebraic numbers have the same long sub-word,…

Number Theory · Mathematics 2017-02-10 Xianzu Lin

Let $\Lambda$ be the limit set of an infinite conformal iterated function system and let $F$ denote the set of fixed points of the maps. We prove that the box dimension of $\Lambda$ exists if and only if \[ \overline{\dim}_{\mathrm B} F\leq…

Dynamical Systems · Mathematics 2024-08-13 Amlan Banaji , Alex Rutar

Traditional asymptotic information-theoretic studies of the fundamental limits of wireless communication systems primarily rely on some ideal assumptions, such as infinite blocklength and vanishing error probability. While these assumptions…

Information Theory · Computer Science 2025-12-29 Junyuan Gao , Shuao Chen , Yongpeng Wu , Liang Liu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

The weak saturation number $\mathrm{wsat}(n,F)$ is the minimum number of edges in a graph on $n$ vertices such that all the missing edges can be activated sequentially so that each new edge creates a copy of $F$. A usual approach to prove a…

Combinatorics · Mathematics 2023-05-26 Nikolai Terekhov , Maksim Zhukovskii