English
Related papers

Related papers: Balanced Stick Breaking

200 papers

Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…

Combinatorics · Mathematics 2014-07-25 Patrick De Causmaecker , Stefan De Wannemacker

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Combinatorics · Mathematics 2025-01-09 Rupam Barman , Pankaj Jyoti Mahanta , Gurinder Singh

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete time Markov chain on a finite state space $\Omega $. Denote its transition matrix by $P$. To avoid periodicity issues (and thus ensuring convergence to equilibrium) one…

Probability · Mathematics 2018-01-29 Jonathan Hermon , Yuval Peres

The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts $1,2$ and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct earlier terms: this gives $1,2,3,4,6,8,11,\dots$. Already in…

Combinatorics · Mathematics 2025-01-28 François Clément , Stefan Steinerberger

Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…

Information Theory · Computer Science 2018-05-17 Sergey Bereg

We consider the (exact, minimum) $k$-cut problem: given a graph and an integer $k$, delete a minimum-weight set of edges so that the remaining graph has at least $k$ connected components. This problem is a natural generalization of the…

Data Structures and Algorithms · Computer Science 2019-10-08 Jason Li

In many applications it will be useful to know those patterns that occur with a balanced interval, e.g., a certain combination of phone numbers are called almost every Friday or a group of products are sold a lot on Tuesday and Thursday. In…

Artificial Intelligence · Computer Science 2007-05-23 Edgar de Graaf Joost Kok Walter Kosters

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

Let $N$ be a positive integer. A sequence $X=(x_1,x_2,\ldots,x_N)$ of points in the unit interval $[0,1)$ is piercing if $\{x_1,x_2,\ldots,x_n\}\cap \left[\frac{i}{n},\frac{i+1}{n} \right) \neq\emptyset$ holds for every $n=1,2,\ldots, N$…

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

Number Theory · Mathematics 2016-09-14 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan , Roberto Tauraso , László Tóth

We consider dynamical systems $(X,T,\mu)$ which have exponential decay of correlations for either H\"older continuous functions or functions of bounded variation. Given a sequence of balls $(B_n)_{n=1}^\infty$, we give sufficient conditions…

Dynamical Systems · Mathematics 2021-08-31 Charis Ganotaki , Tomas Persson

The classic string indexing problem is to preprocess a string $S$ into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string $P$, report all occurrences of $P$ within $S$. In…

Data Structures and Algorithms · Computer Science 2024-02-15 Philip Bille , Inge Li Gørtz , Max Rishøj Pedersen , Eva Rotenberg , Teresa Anna Steiner

Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…

Probability · Mathematics 2020-10-20 Andrea Ottolini

We characterize the fractional Dehn twist coefficient (FDTC) on the $n$-stranded braid group as the unique homogeneous quasimorphism to the real numbers of defect at most 1 that equals 1 on the positive full twist and vanishes on the…

Geometric Topology · Mathematics 2025-01-15 Peter Feller

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

Discrete Mathematics · Computer Science 2014-07-10 Ronan Le Bras , Carla P. Gomes , Bart Selman

The number balancing (NBP) problem is the following: given real numbers $a_1,\ldots,a_n \in [0,1]$, find two disjoint subsets $I_1,I_2 \subseteq [n]$ so that the difference $|\sum_{i \in I_1}a_i - \sum_{i \in I_2}a_i|$ of their sums is…

Discrete Mathematics · Computer Science 2016-11-30 Rebecca Hoberg , Harishchandra Ramadas , Thomas Rothvoss , Xin Yang

Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…

Combinatorics · Mathematics 2015-03-03 Bela Bollobas , Zoltan Furedi , Ida Kantor , G. O. H. Katona , Imre Leader

An analysis of stick-slip behavior and convergence of trajectories in the feedback-controlled motion systems with discontinuous Coulomb friction is provided. A closed-form parameter-dependent stiction region, around an invariant equilibrium…

Systems and Control · Electrical Eng. & Systems 2021-09-30 Michael Ruderman

Our object of study is the general class of stick-breaking processes with exchangeable length variables. These generalize well-known Bayesian non-parametric priors in an unexplored direction. We give conditions to assure the respective…

Statistics Theory · Mathematics 2021-07-20 María F. Gil-Leyva , Ramsés H. Mena