English
Related papers

Related papers: Gap Sequence of Cutting Sequence with Slope $\thet…

200 papers

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Golnaz Badkobeh , Gabriele Fici , Zsuzsanna Lipták

We consider products of $\psi$ classes and products of $\omega$ classes on $\overline{M}_{0,n+3}$. For each product, we construct a flat family of subschemes of $\overline{M}_{0,n+3}$ whose general fiber is a complete intersection…

Algebraic Geometry · Mathematics 2022-01-20 Maria Gillespie , Sean T. Griffin , Jake Levinson

A collection of sets satisfies a $(\delta,\varepsilon)$-proximity gap with respect to some property if for every set in the collection, either (i) all members of the set are $\delta$-close to the property in (relative) Hamming distance, or…

Information Theory · Computer Science 2026-01-16 Fernando Granha Jeronimo , Lenny Liu , Pranav Rajpal

We give a spectral gap characterization of fullness for type $\mathrm{III}$ factors which is the analog of a theorem of Connes in the tracial case. Using this criterion, we generalize a theorem of Jones by proving that if $M$ is a full…

Operator Algebras · Mathematics 2016-11-16 Amine Marrakchi

Pseudogap physics in strongly correlated systems is essentially scale dependent. We generalize the dynamical mean field theory (DMFT) by including into the DMFT equations dependence on correlation length of pseudogap fluctuations via…

Strongly Correlated Electrons · Physics 2007-05-23 E. Z. Kuchinskii , I. A. Nekrasov , M. V. Sadovskii

For any positive integer $k$, we show that infinitely often, perfect $k$-th powers appear inside very long gaps between consecutive prime numbers, that is, gaps of size $$ c_k \frac{\log p \log_2 p \log_4 p}{(\log_3 p)^2}, $$ where $p$ is…

Number Theory · Mathematics 2014-11-25 Kevin Ford , D. R. Heath-Brown , Sergei Konyagin

Segmentation, a new approach based on successive edge contraction is introduced for extract method refactoring. It targets identification of distinct functionalities implemented within a method. Segmentation builds upon data and control…

Software Engineering · Computer Science 2019-08-14 Omkarendra Tiwari , Rushikesh K. Joshi

This paper catalogues a variety of examples concerning a type of function of a $p$-adic integer variable defined by a formal series expression we have dubbed "$\mathcal{F}$-series". These series exhibit a new, previously undocumented form…

General Mathematics · Mathematics 2023-07-04 Maxwell C. Siegel

We provide an ergodic theory framework to study statistical properties of smooth sequences over the odd alphabet {1, 3}. The arithmetic nature of this alphabet yields a partition of the subshift of smooth sequences based on their local…

Dynamical Systems · Mathematics 2026-04-16 Damien Jamet , Irène Marcovici , Léo Poirier , Thierry de la Rue

A frequency permutation array (FPA) of length $n=m\lambda$ and distance $d$ is a set of permutations on a multiset over $m$ symbols, where each symbol appears exactly $\lambda$ times and the distance between any two elements in the array is…

Information Theory · Computer Science 2009-01-15 Min-Zheng Shieh , Shi-Chun Tsai

Proximity gaps and correlated agreement have become central tools in the analysis of interactive oracle proofs of proximity (IOPPs) and code-based SNARKs. Informally, a proximity-gap statement says that for a structured set of words -- such…

Information Theory · Computer Science 2026-05-11 Chen Yuan , Ruiqi Zhu

We discuss both theoretical tools to verify gauge invariance in numerical calculations of cross sections and the consistency of approximation schemes used in realistic calculations. A finite set of Ward Identities for 4 point scattering…

High Energy Physics - Phenomenology · Physics 2007-05-23 Christian Schwinn

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

Group Theory · Mathematics 2017-01-30 Daniel C. Mayer

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

Computational Complexity · Computer Science 2023-07-19 Stefan Rass

Let $\Fth$ be a single vertex \textsf{k}-graph, and $\pi_\omega(\O_\theta)"$ be the von Neumann algebra induced from the GNS representation of a distinguished state $\omega$ of its $\textsf{k}$-graph C*-algebra $\O_\theta$. In this paper,…

Operator Algebras · Mathematics 2015-09-08 Dilian Yang

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Number Theory · Mathematics 2025-08-11 Ayla Gafni , Terence Tao

In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…

Differential Geometry · Mathematics 2012-03-06 Boris Kruglikov

We consider divergent integrals $\int_X \omega$ of certain forms $\omega$ on a reduced pure-dimensional complex space $X$. The forms $\omega$ are singular along a subvariety defined by the zero set of a holomorphic section $s$ of some…

Complex Variables · Mathematics 2025-02-26 Ludvig Svensson

The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…

Data Structures and Algorithms · Computer Science 2023-04-04 Paweł Gawrychowski , Garance Gourdel , Tatiana Starikovskaya , Teresa Anna Steiner

Let d \geq d_0 be a sufficiently large constant. A (n,d,c \sqrt{d}) graph G is a d-regular graph over n vertices whose second largest (in absolute value) eigenvalue is at most c \sqrt{d}. For any 0 < p < 1, G_p is the graph induced by…

Probability · Mathematics 2007-05-23 Eran Ofek