English
Related papers

Related papers: Well-distributed great circles on S^2

200 papers

Let $C_1,C_2\subseteq\mathbb{G}_m^N(\mathbb{C})$ be irreducible closed algebraic curves, with $N\geq 3$. Suppose $C_1$ is not contained in an algebraic subgroup of $\mathbb{G}_m^N(\mathbb{C})$ of dimension $1$ and $C_1\cup C_2$ is not…

Algebraic Geometry · Mathematics 2024-01-11 Gareth Boxall

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T}$ exhibits Poissonian pair correlation if for all $s\geq0$, \begin{equation*} \lim_{N\to\infty} \frac{1}{N}\#\left\{1\leq m\neq n \leq N : |x_m-x_n| \leq \frac{s}{N}\right\} = 2s.…

Number Theory · Mathematics 2020-12-15 Alex Cohen

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

We study the existence of large solutions for nonlocal Dirichlet problems posed on a bounded, smooth domain, associated to fully nonlinear elliptic equations of order $2s$, with $s\in (1/2,1)$, and a coercive gradient term with subcritical…

Analysis of PDEs · Mathematics 2022-03-25 Gonzalo Dávila , Alexander Quaas , Erwin Topp

Let $(\mathcal{A}_i)_{i \in [s]}$ be a sequence of dense subsets of the Boolean cube $\{0,1\}^n$ and let $p$ be a prime. We show that if $s$ is assumed to be superpolynomial in $n$ then we can find distinct $i,j$ such that the two…

Combinatorics · Mathematics 2023-09-26 Thomas Karam

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

Metric Geometry · Mathematics 2025-05-07 Károly Bezdek , Zsolt Lángi

Let $\{X_{i,j}:(i,j)\in\mathbb N^2\}$ be a two-dimensional array of independent copies of a random variable $X$, and let $\{N_n\}_{n\in\mathbb N}$ be a sequence of natural numbers such that $\lim_{n\to\infty}e^{-cn}N_n=1$ for some $c>0$.…

Probability · Mathematics 2009-11-24 Zakhar Kabluchko

We consider a problem introduced by Feige, Gamarnik, Neeman, R\'acz and Tetali [2020], that of finding a large clique in a random graph $G\sim G(n,\frac{1}{2})$, where the graph $G$ is accessible by queries to entries of its adjacency…

Data Structures and Algorithms · Computer Science 2021-12-14 Uriel Feige , Tom Ferster

Superclusters are the most massive structures in the universe. To what degree they are actually bound against an accelerating expansion of the background is of significant cosmological and astrophysical interest. In this study, we introduce…

Cosmology and Nongalactic Astrophysics · Physics 2025-11-05 B. A. Seidel , K. Dolag , R. -S. Remus , J. G. Sorce , E. Hernández-Martínez , I. Khabibullin , N. Aghanim

Fix $q\neq 1$, and sample $w\in S_n$ from the Mallows measure. We study the distribution of $C_i(w)$, the number of $i$-cycles, as $n$ grows large. When $q<1$, they are jointly Gaussian, and this more or less follows from known ideas, but…

Probability · Mathematics 2022-06-22 Jimmy He

In 2006, Marcus and Tardos proved that if $A^1,\dots,A^n$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^i$ and $A^j$ appear in reversed cyclic order in $A^i$ and $A^j$,…

Combinatorics · Mathematics 2024-11-12 Barnabás Janzer , Oliver Janzer , Abhishek Methuku , Gábor Tardos

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

Number Theory · Mathematics 2014-12-17 James Maynard

In this article, we consider `$N$'spherical caps of area $4\pi p$ were uniformly distributed over the surface of a unit sphere. We are giving the strong threshold function for the size of random caps to cover the surface of a unit sphere.…

Probability · Mathematics 2008-09-09 Bhupendra Gupta

We extend to alternating groups $A_n$ several results about symmetric groups asserting that under various conditions on a conjugacy class, or more generally, a normal subset, $C$ of $S_n$, we have $C^2 \supseteq A_n\setminus\{1\}$

Group Theory · Mathematics 2023-05-09 Michael J. Larsen , Pham Huu Tiep

Topological singularities are ubiquitous in many areas of physics. Polarization singularities are locations at which an aspect of the polarization ellipse of light becomes undetermined or degenerate. At C points the orientation of the…

Optics · Physics 2018-10-24 L. De Angelis , F. Alpeggiani , L. Kuipers

In this paper, we prove two theorems concerning the sums of squared distances between points on a unit $n$-sphere that generalize two facts previously known about the case where the points are the vertices of a regular polygon. The first…

Metric Geometry · Mathematics 2020-01-10 Jessica N. Copher

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

Functional Analysis · Mathematics 2009-11-10 Laurent Baratchart , Juliette Leblond , Fabien Seyfert

The total diameter of a closed planar curve $C\subset R^2$ is the integral of its antipodal chord lengths. We show that this quantity is bounded below by twice the area of $C$. Furthermore, when $C$ is convex or centrally symmetric, the…

Differential Geometry · Mathematics 2015-01-20 Mohammad Ghomi , Ralph Howard

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

Classical Analysis and ODEs · Mathematics 2014-08-12 Tuomas Orponen

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev