English
Related papers

Related papers: On Periodicity Lemma for Partial Words

200 papers

In this work we consider the list-decodability and list-recoverability of arbitrary $q$-ary codes, for all integer values of $q\geq 2$. A code is called $(p,L)_q$-list-decodable if every radius $pn$ Hamming ball contains less than $L$…

Information Theory · Computer Science 2022-10-17 Nicolas Resch , Chen Yuan , Yihan Zhang

The approximate period recovery problem asks to compute all $\textit{approximate word-periods}$ of a given word $S$ of length $n$: all primitive words $P$ ($|P|=p$) which have a periodic extension at edit distance smaller than $\tau_p$ from…

Data Structures and Algorithms · Computer Science 2018-07-30 Tomasz Kociumaka , Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

Suppose that $P$ is a property that may be satisfied by a random code $C \subset \Sigma^n$. For example, for some $p \in (0,1)$, ${P}$ might be the property that there exist three elements of $C$ that lie in some Hamming ball of radius…

Information Theory · Computer Science 2024-07-11 Venkatesan Guruswami , Jonathan Mosheiff , Nicolas Resch , Shashwat Silas , Mary Wootters

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Number Theory · Mathematics 2022-07-11 Marco Aymone

Many speech and music analysis and processing schemes rely on an estimate of the fundamental frequency $f_0$ of periodic signal components. Most established schemes apply rather unspecific signal models such as sinusoidal models to the…

Sound · Computer Science 2021-12-23 Volker Hohmann

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and let $E(T)$ denote the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) := E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x)…

Number Theory · Mathematics 2013-05-10 Aleksandar Ivić

Let g : $\Omega$ = [0, 1] d $\rightarrow$ R denote a Lipschitz function that can be evaluated at each point, but at the price of a heavy computational time. Let X stand for a random variable with values in $\Omega$ such that one is able to…

Probability · Mathematics 2021-07-29 Lucie Bernard , Albert Cohen , Arnaud Guyader , Florent Malrieu

We prove that the Return Times Theorem holds true for pairs of $L^p-L^q$ functions, whenever $\frac{1}{p}+\frac{1}{q}<{3/2}$.

Classical Analysis and ODEs · Mathematics 2019-08-15 Ciprian Demeter

In this article, we study the fractional spherical maximal function and its lacunary counterpart. We study the necessary and sufficient conditions for $L^p-L^q$ boundedness of both maximal functions. In particular, we prove the restricted…

Analysis of PDEs · Mathematics 2026-04-29 Riju Basak , Surjeet Singh Choudhary , Daniel Spector

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

Combinatorics · Mathematics 2016-05-10 Zhumagali Shomanov

Let $\mathfrak{q}>2$ be a prime number, $\chi$ a primitive Dirichlet character modulo $\mathfrak{q}$ and $f$ a primitive holomorphic cusp form or a Hecke-Maass cusp form of level $\mathfrak{q}$ and trivial nebentypus. We prove the subconvex…

Number Theory · Mathematics 2020-05-19 Qingfeng Sun , Hui Wang

Consider a Henselian rank one valued field $K$ of equicharacteristic zero along with the language $\mathcal{L}^{P}$ of Denef--Pas. Let $f: A \to K$ be an $\mathcal{L}^{P}$-definable (with parameters) function on a subset $A$ of $K^{n}$. We…

Algebraic Geometry · Mathematics 2017-02-28 Krzysztof Jan Nowak

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

Artificial Intelligence · Computer Science 2018-07-02 Brendan Juba

Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…

Logic in Computer Science · Computer Science 2026-02-16 Jan Krajicek

The properties of continued fractions whose partial quotients belong to a quadratic number field K are distinct from those of classical continued fractions. Unlike classical continued fractions, it is currently impossible to identify…

Number Theory · Mathematics 2023-04-25 Zhaonan Wang , Yingpu Deng

We study the problem of estimating the number of points of coincidences of an idealized gap on the set of integers under a given multiplicative function $g:\mathbb{N}\longrightarrow \mathbb{C}$ respectively additive function…

Number Theory · Mathematics 2026-04-21 Theophilus Agama

We obtain an asymptotic formula for the fourth moment of quadratic Dirichlet $L$--functions over $\mathbb{F}_q[x]$, as the base field $\mathbb{F}_q$ is fixed and the genus of the family goes to infinity. According to conjectures of Andrade…

Number Theory · Mathematics 2016-09-06 Alexandra Florea

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a non-principal quadratic character to the modulus $q$. We make explicit a result due to Pintz and Stephens by showing that $|L(1, \chi)|\leq \frac{1}{2}\log q$ for all $q\geq…

Number Theory · Mathematics 2023-03-27 D. R. Johnston , O. Ramare , T. S. Trudgian

We discuss the syntax and semantics of relational Horn logic (RHL) and partial Horn logic (PHL). RHL is an extension of the Datalog programming language that allows introducing and equating variables in conclusions. PHL is a syntactic…

Logic in Computer Science · Computer Science 2026-05-07 Martin E. Bidlingmaier
‹ Prev 1 4 5 6 7 8 10 Next ›