English
Related papers

Related papers: A structure theorem for level sets of multiplicati…

200 papers

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…

Logic · Mathematics 2018-03-21 Alexander Berenstein , Juan Felipe Carmona , Evgueni Vassiliev

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

Probability · Mathematics 2020-12-15 Dariusz Buraczewski , Bohdan Dovgay , Alexander Marynych

In work by Freedman [F2] and Freedman-Quinn [FQ] on the topology of 4-manifolds, null decompositions whose non-singleton elements are, in the terminology of [MOR], recursively starlike-equivalent sets of filtration length 1 arise and are…

Geometric Topology · Mathematics 2020-09-15 Fredric D. Ancel

A subset $E$ of a metric space $X$ is said to be starlike-equivalent if it has a neighbourhood which is mapped homeomorphically into $\mathbb{R}^n$ for some $n$, sending $E$ to a starlike set. A subset $E\subset X$ is said to be recursively…

Geometric Topology · Mathematics 2024-05-13 Jeffrey Meier , Patrick Orson , Arunima Ray

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

A commuting tuple of $n$ operators $(S_1, \dots, S_{n-1}, P)$ defined on a Hilbert space $\mathcal{H}$, for which the closed symmetrized polydisc \[ \Gamma_n = \left\{ \left(\sum_{i=1}^{n}z_i, \sum\limits_{1\leq i<j\leq n}z_iz_j, \dots,…

Functional Analysis · Mathematics 2019-11-11 Bappa Bisai , Sourav Pal

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…

Combinatorics · Mathematics 2023-12-12 Djamila Oudrar , Maurice Pouzet

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open…

Computational Geometry · Computer Science 2026-01-13 Boris Aronov , Esther Ezra , Joshua Zahl

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Information Theory · Computer Science 2022-12-12 Yue Yu , Pavel Loskot

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Number Theory · Mathematics 2007-05-23 Pieter Moree , Peter Stevenhagen

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

Standard results in descriptive set theory provide sufficient conditions for a Borel set $P \subseteq \mathbb{N}^\mathbb{N} \times \mathbb{N}^\mathbb{N}$ to admit a Borel uniformization, namely, when $P$ has "small" sections or "large"…

Logic · Mathematics 2025-08-26 Alexander S. Kechris , Michael Wolman

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…

Logic · Mathematics 2016-05-27 Vassilios Gregoriades , Takayuki Kihara , Keng Meng Ng

In this thesis we studied the structure coefficients and especially their dependence on $n$ in the case of a sequence of double-class algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases…

Combinatorics · Mathematics 2014-12-08 Omar Tout

We prove a multiple recurrence result for arbitrary measure-preserving transformations along polynomials in two variables of the form $m+p_i(n)$, with rationally independent $p_i$'s with zero constant term. This is in contrast to the single…

Dynamical Systems · Mathematics 2019-02-20 Nikos Frantzikinakis , Pavel Zorin-Kranich

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

Combinatorics · Mathematics 2025-06-03 Arkabrata Ghosh , Sayan Goswami , Sourav Kanti Patra

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Numerical Analysis · Mathematics 2025-01-22 Leokadia Bialas-Ciez , Agnieszka Kowalska , Alvise Sommariva
‹ Prev 1 8 9 10 Next ›