English
Related papers

Related papers: Continuous Tur\'an numbers

200 papers

The Radon transform is a bounded operator from $L^p$ of Euclidean space to $L^q$ of the manifold of all affine hyperplanes in $\mathbb{R}^n$ for certain exponents depending dimension. Extremizers have been determined for certain values of…

Classical Analysis and ODEs · Mathematics 2025-08-04 Taryn C. Flock

The Tur\'an number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P_k be the path with k vertices, the square P^2_k of P_k is obtained by joining the pairs of vertices…

Combinatorics · Mathematics 2019-12-06 Chuanqi Xiao , Gyula O. H. Katona , Jimeng Xiao , Oscar Zamora

The Tur\'an number $\mathrm{ex}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex graph which does not contain $H$ as a subgraph. The Tur\'{a}n number of regular polyhedrons was widely studied in a series of works due to…

Combinatorics · Mathematics 2024-11-21 Xiaocong He , Yongtao Li , Lihua Feng

We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness…

Computational Geometry · Computer Science 2017-09-28 Peter Franek , Marek Krčál , Hubert Wagner

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

Number Theory · Mathematics 2007-06-28 Johan Andersson

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

Logic in Computer Science · Computer Science 2016-03-04 Edward Hermann Haeusler

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Computational Complexity · Computer Science 2020-07-07 Pascal Koiran

Let G be a locally compact Abelian group, and let X, Y be two open sets in G. We investigate the extremal constant C(X,Y) defined to be the supremum of integrals of functions f from the class F(X,Y), where F(X,Y) is the family of positive…

Classical Analysis and ODEs · Mathematics 2022-01-05 Elena Berdysheva , Szilárd Gy. Révész

This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to produce the hyperplane (passing through the origin) which…

Computational Complexity · Computer Science 2012-02-06 Zohar Karnin , Edo Liberty , Shachar Lovett , Roy Schwartz , Omri Weinstein

Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability of $X$ whenever an associated extremal…

Probability · Mathematics 2021-04-14 Matan Harel , Frank Mousset , Wojciech Samotij

Let $\{X(s,t):s,t\geqslant 0\}$ be a centered homogeneous Gaussian field with a.s. continuous sample paths and correlation function $r(s,t)=Cov(X(s,t),X(0,0))$ such that…

Probability · Mathematics 2013-12-11 Krzysztof Dębicki , Enkelejd Hashorva , Natalia Soja-Kukieła

Fix graphs $F$ and $H$ and let $ex(n,H,F)$ denote the maximum possible number of copies of the graph $H$ in an $n$-vertex $F$-free graph. The systematic study of this function was initiated by Alon and Shikhelman [{\it J. Comb. Theory, B}.…

Combinatorics · Mathematics 2019-09-10 Dániel Gerbner , Cory Palmer

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…

Dynamical Systems · Mathematics 2025-07-29 Konstantin Bogdanov

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Combinatorics · Mathematics 2011-08-26 Konrad J. Swanepoel , Pavel Valtr

We introduce $p$-uniformity to characterize the scaling of density fluctuations in spatial random systems in $\mathbb{R}^d$, ranging from hyperfluctuation to stealthy hyperuniformity. Our central theorem establishes sufficient conditions to…

Probability · Mathematics 2026-05-22 Luca Lotz , Michael A. Klatt

Given $N\ge2$ closed subspaces $M_1,\dotsc, M_N$ of a Hilbert space $X$, let $P_k$ denote the orthogonal projection onto $M_k$, $1\le k\le N$. It is known that the sequence $(x_n)$, defined recursively by $x_0=x$ and $x_{n+1}=P_N\cdots…

Functional Analysis · Mathematics 2019-02-14 Catalin Badea , David Seifert

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban

Using methods of R.J.Tauer we exhibit an uncountable family of singular masas in the hyperfinite $\textrm{II}_1$ factor $\R$ all with Puk\'anszky invariant $\{1\}$, no pair of which are conjugate by an automorphism of $R$. This is done by…

Operator Algebras · Mathematics 2007-05-23 Allan Sinclair , Stuart White

We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…

Statistical Mechanics · Physics 2007-05-23 F. Hivert , S. Nechaev , G. Oshanin , O. Vasilyev

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas