English
Related papers

Related papers: The Dimension of Divisibility Orders and Multiset …

200 papers

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

Combinatorics · Mathematics 2011-04-08 Svante Janson

A major open problem in the field of metric embedding is the existence of dimension reduction for $n$-point subsets of Euclidean space, such that both distortion and dimension depend only on the {\em doubling constant} of the pointset, and…

Computational Geometry · Computer Science 2013-08-26 Yair Bartal , Lee-Ad Gottlieb , Ofer Neiman

In this paper we combine ideas from tolerance orders with recent work on OC interval orders. We consider representations of posets by unit intervals $I_v$ in which the interval endpoints ($L(v)$ and $R(v)$) may be open or closed as well as…

Combinatorics · Mathematics 2017-07-26 Alan Shuchat , Randy Shull , Ann N Trenk

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…

Data Structures and Algorithms · Computer Science 2018-11-09 Sepideh Mahabadi , Konstantin Makarychev , Yury Makarychev , Ilya Razenshteyn

A poset $P = (X,\prec)$ is a unit OC interval order if there exists a representation that assigns an open or closed real interval $I(x)$ of unit length to each $x \in P$ so that $x \prec y$ in $P$ precisely when each point of $I(x)$ is less…

Combinatorics · Mathematics 2015-01-27 Alan Shuchat , Randy Shull , Ann Trenk

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

Symbolic Computation · Computer Science 2017-05-09 Amir Hashemi , Werner M. Seiler

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

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

We settle the issue of well-posedness for the Dirichlet problem for a higher order elliptic system ${\mathcal L}(x,D_x)$ with complex-valued, bounded, measurable coefficients in a Lipschitz domain $\Omega$, with boundary data in Besov…

Analysis of PDEs · Mathematics 2007-05-23 Vladimir Maz'ya , Marius Mitrea , Tatyana Shaposhnikova

For a planar point-set $P$, let D(P) be the minimum number of pairwise-disjoint empty disks such that each point in $P$ lies on the boundary of some disk. Further define D(n) as the maximum of D(P) over all n-element point sets. Hosono and…

Combinatorics · Mathematics 2012-07-31 Adrian Dumitrescu , Minghui Jiang

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

For a (finite) partially ordered set (poset) $P$, we call a dominating set $D$ in the comparability graph of $P$, an order-sensitive dominating set in $P$ if either $x\in D$ or else $a<x<b$ in $P$ for some $a,b\in D$ for every element $x$…

Combinatorics · Mathematics 2023-07-28 Yusuf Civan , Zakir Deniz , Mehmet Akif Yetim

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

Combinatorics · Mathematics 2023-03-15 Robert F. Bailey , Pablo Spiga

On a bounded domain $\Omega\subset\mathbb R^{n+1}$, $n\geq2$, satisfying the corkscrew condition and with Ahlfors regular boundary, we characterize the dual space to the space ${\bf N}_{2,p}$ of functions $u$ whose Kenig-Pipher modified…

Analysis of PDEs · Mathematics 2026-02-10 Mihalis Mourgoglou , Bruno Poggi

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…

Number Theory · Mathematics 2019-08-19 Khalid Younis

In the current paper we obtain discrepancy estimates in exponential Orlicz and BMO spaces in arbitrary dimension $d \ge 3$. In particular, we use dyadic harmonic analysis to prove that for the so-called digital nets of order $2$ the…

Functional Analysis · Mathematics 2015-07-10 Dmitriy Bilyk , Lev Markhasin

We prove that if $\alpha\in (0,1/2]$, then the packing dimension of a set $E\subset\mathbb{R}^2$ for which there exists a set of lines of dimension $1$ intersecting $E$ in dimension $\ge \alpha$ is at least $1/2+\alpha+c(\alpha)$ for some…

Classical Analysis and ODEs · Mathematics 2024-08-19 Pablo Shmerkin

The pinched Veronese poset $V^*_n$ is the poset with ground set consisting of all non-negative integer vectors of length n such that the sum of their coordinates is divisible by $n$ with exception of the vector $(1,...,1)$. For two vectors…

Combinatorics · Mathematics 2014-02-25 Martin Tancer

A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…

Classical Analysis and ODEs · Mathematics 2015-09-02 Dmitriy Bilyk , Michael T Lacey