English
Related papers

Related papers: Balancing Extensions in Posets of Large Width

200 papers

Let (X,d,p) be a pointed metric space. A pretangent space to X at p is a metric space consisting of some equivalence classes of convergent to p sequences (x_n), x_n \in X, whose degree of convergence is comparable with a given scaling…

Metric Geometry · Mathematics 2013-02-20 Viktoriia Bilet , Oleksiy Dovgoshey

Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…

Number Theory · Mathematics 2017-12-04 Alexander Dunn

Partial orders are a natural model for the social hierarchies that may constrain "queue-like" rank-order data. However, the computational cost of counting the linear extensions of a general partial order on a ground set with more than a few…

Methodology · Statistics 2023-06-29 Chuxuan , Jiang , Geoff K. Nicholls , Jeong Eun Lee

Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…

Statistical Mechanics · Physics 2012-10-23 Michael T Gastner , Beata Oborny

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

Combinatorics · Mathematics 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

In this work, recent results on the moments of balanced P\'olya urns are generalized to unbalanced urns, with the condition that the expected change in total activity at each step is constant. We also provide applications of our results to…

Probability · Mathematics 2026-03-19 Colin Desmarais

In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…

Computational Geometry · Computer Science 2021-01-05 Andrey Kupavskii , Nikita Zhivotovskiy

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…

Computational Geometry · Computer Science 2010-06-03 Prosenjit Bose , Luc Devroye , Maarten Löffler , Jack Snoeyink , Vishal Verma

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

Data Structures and Algorithms · Computer Science 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

Logic · Mathematics 2021-06-24 Pantelis E. Eleftheriou , Alex Savatovsky

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

The Pareto dominance relation of a preference profile is (the asymmetric part of) a partial order. For any integer n, the problem of the existence of an n-agent preference profile that generates the given Pareto dominance relation is to…

Combinatorics · Mathematics 2014-02-24 Shaofang Qi

We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…

Number Theory · Mathematics 2011-07-20 Itai Benjamini , Boris Solomyak

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

Data Structures and Algorithms · Computer Science 2025-07-02 Fritz Bökler , Markus Chimani , Henning Jasper

A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…

Combinatorics · Mathematics 2017-06-20 Imed Zaguia

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…

Information Theory · Computer Science 2010-12-17 Arya Mazumdar , Ron M. Roth , Pascal O. Vontobel

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

Probability · Mathematics 2016-05-23 Pratulananda Das , Sanjoy Ghosal , Vatan Karakaya , Sumit Som

Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…

Probability · Mathematics 2014-09-30 Raphael Hauser , Heinrich Matzinger , Ionel Popescu

In this paper, we deal with the growth and oscillation of solutions of higher order linear differential equations. Under the conditions that there exists a coefficient which dominates the other coefficients by its lower $% (\alpha ,\beta…

Complex Variables · Mathematics 2024-07-30 Benharrat Belaïdi
‹ Prev 1 3 4 5 6 7 10 Next ›