中文
相关论文

相关论文: Comparing balanced $\mathbb{Z}_v$-sequences obtain…

200 篇论文

Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements in the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical…

密码学与安全 · 计算机科学 2026-04-14 Chunlei Li

In this paper, we investigate extreme singular values of the analysis matrix of a Gabor frame $(g, \Lambda)$ with a random window $g$. Columns of such matrices are time and frequency shifts of $g$, and $\Lambda\subset…

概率论 · 数学 2019-02-05 Palina Salanevich

We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…

组合数学 · 数学 2016-07-26 Pandelis Dodos , Vassilis Kanellopoulos , Thodoris Karageorgos

We study the relationship between the growth rate of an integer sequence and harmonic and functional properties of the corresponding sequence of characters. In particular we show that every polynomial sequence contains a set that is…

泛函分析 · 数学 2026-03-31 Stefan Neuwirth

We study failure rate monotonicity and generalized convex transform stochastic ordering properties of random variables, with a concern on applications. We are especially interested in the effect of a tail weight iteration procedure to…

概率论 · 数学 2026-01-14 Idir Arab , Milto Hadjikyriakou , Paulo Eduardo Oliveira

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

数论 · 数学 2014-09-10 Satwik Mukherjee

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

组合数学 · 数学 2010-03-30 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

Let $F$ be a class of functions on a probability space $(\Omega,\mu)$ and let $X_1,...,X_k$ be independent random variables distributed according to $\mu$. We establish high probability tail estimates of the form $\sup_{f \in F} |\{i :…

概率论 · 数学 2007-05-23 Shahar Mendelson

The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…

概率论 · 数学 2014-12-02 Barbara H. Jasiulis-Gołdyn

Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…

组合数学 · 数学 2021-10-14 Narad Rampersad , Jeffrey Shallit

Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…

概率论 · 数学 2019-06-18 Jim Pitman , Wenpin Tang

We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a…

密码学与安全 · 计算机科学 2025-10-10 Yurang R. Kuang

We consider the transverse-momentum ($p_T$) distribution of $Z\gamma$ pairs produced in hadronic collisions. Logarithmically enhanced contributions at small $p_T$ are resummed to all orders in QCD perturbation theory and combined with the…

高能物理 - 唯象学 · 物理学 2020-08-26 Marius Wiesemann , Luca Rottoli , Paolo Torrielli

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

数值分析 · 数学 2007-05-23 Miklos Bona

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…

数论 · 数学 2013-12-10 Fred B. Holt , Helgi Rudd

We study the conformational properties of heteropolymers containing two types of monomers A and B, modeled as self-avoiding random walks on a regular lattice. Such a model can describe in particular the sequences of hydrophobic and…

无序系统与神经网络 · 物理学 2014-09-01 Viktoria Blavatska , Wolfhard Janke

We show that for every hereditary permutation property P and every eps>0, there exists an integer M such that if a permutation p is eps-far from P in the Kendall's tau distance, then a random subpermutation of p of order M has the property…

离散数学 · 计算机科学 2015-03-20 Tereza Klimosova , Daniel Kral

We study the $\ell_p$ regression problem, which requires finding $\mathbf{x}\in\mathbb R^{d}$ that minimizes $\|\mathbf{A}\mathbf{x}-\mathbf{b}\|_p$ for a matrix $\mathbf{A}\in\mathbb R^{n \times d}$ and response vector…

数据结构与算法 · 计算机科学 2022-03-16 Raphael A. Meyer , Cameron Musco , Christopher Musco , David P. Woodruff , Samson Zhou

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

组合数学 · 数学 2017-06-12 Christian Bean , Anders Claesson , Henning Ulfarsson

An ordinal pattern for a finite sequence of real numbers is a permutation that records the relative positions in the sequence. For random walks with steps drawn uniformly from $[-1,1]$, we show an ordinal pattern occurs with probability…

组合数学 · 数学 2019-07-29 Hugh Denoncourt