English
Related papers

Related papers: Compatible sequences and a slow Winkler percolatio…

200 papers

We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…

Combinatorics · Mathematics 2026-03-02 Benjamin Testart

We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assume that the sync pattern of length N starts being emitted at…

Information Theory · Computer Science 2007-08-23 Venkat Chandar , Aslan Tchamkerten , Gregory Wornell

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

Computational Complexity · Computer Science 2012-10-23 Deepak Ponvel Chermakani

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

Probability · Mathematics 2017-06-19 Alain-Sol Sznitman

We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…

Combinatorics · Mathematics 2012-02-14 Li Wei , Wangdong Qi , Dingxing Chen , Peng Liu , En Yuan

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

Symbolic Computation · Computer Science 2024-12-12 Alaa Ibrahim , Bruno Salvy

We study the statistics of pairs from the sequence $(n^\alpha)_{n\in\mathbb{N}^*}$, for every parameter $\alpha \in \, ]0,1[$. We prove the convergence of the empirical pair correlation measures towards a measure with an explicit density.…

Number Theory · Mathematics 2025-02-20 Rafael Sayous

A necessary condition is given for a sequence of identically distributed and pairwise positively quadrant dependent random variables obeying the strong laws of large numbers with respect to the normalising constants $n^{1/p}$ $(1 \leqslant…

Probability · Mathematics 2020-10-27 João Lita da Silva

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…

Probability · Mathematics 2021-08-02 Shirshendu Chatterjee , Jack Hanson , Philippe Sosoe

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

General Mathematics · Mathematics 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a…

Number Theory · Mathematics 2016-03-10 Helmut Maier , Michael Th. Rassias

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

Data Structures and Algorithms · Computer Science 2009-09-11 David Eppstein

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

Combinatorics · Mathematics 2025-12-01 Thierry Monteil , Khaydar Nurligareev

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…

Symbolic Computation · Computer Science 2024-07-29 Hans Zantema

For a sequence of identically distributed negatively associated random variables $\{X_n; n\geq 1\}$ with partial sums $S_n=\sum_{i=1}^nX_i, n\geq 1$, refinements are presented of the classical Baum-Katz and Lai complete convergence…

Probability · Mathematics 2008-02-20 Han-Ying Liang , Deli Li , Andrew Rosalsky

We consider the problem of recovering a smooth, compactly supported potential on R^3 from its backscattering data. We show that if two such potentials have the same backscattering data and the difference of the two potentials has controlled…

Analysis of PDEs · Mathematics 2015-06-16 Rakesh , Gunther Uhlmann

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

General Mathematics · Mathematics 2024-03-18 Yuri Heymann

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

Logic in Computer Science · Computer Science 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema