English
Related papers

Related papers: On the $j$-th smallest modulus of a covering syste…

200 papers

We prove a compactness result for minimal hypersurfaces with bounded index and volume, which can be thought of as an extension of the compactness theorem of Choi-Schoen (Invent. Math. 1985) to higher dimensions.

Differential Geometry · Mathematics 2015-01-13 Ben Sharp

We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…

Algebraic Geometry · Mathematics 2022-08-22 Omprokash Das , Joe Waldron

A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings…

Metric Geometry · Mathematics 2015-05-27 János Pach , Dömötör Pálvölgyi

We study M theory compactifications on manifolds of $G_2$-holonomy with gauge and matter fields supported at singularities. We show that, under certain topological conditions, the combination of background $G$-flux and background fields at…

High Energy Physics - Theory · Physics 2007-05-23 Bobby S Acharya

A conjecture of De Concini Kac and Procesi provides a bound on the minimal possible dimension of an irreducible module for quantized enveloping algebras at an odd root of unity. We pose the problem of the existence of modules whose…

Representation Theory · Mathematics 2016-07-20 Giovanna Carnovale , Iulian I. Simion

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…

Combinatorics · Mathematics 2025-11-10 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…

General Mathematics · Mathematics 2024-10-15 Stijn Cambie

In this note we show that finitely generated unit $O_X[\sigma]$--modules for $X$ regular and $F$--finite have a minimal root (in the sense of [Lyubeznik, F-modules] Definition~3.6). This problem was posed by Lyubeznik and answered by…

Algebraic Geometry · Mathematics 2011-02-18 Manuel Blickle

We prove existence and regularity of minimizers for H\"older densities over general surfaces of arbitrary dimension and codimension in \(\R^n \), satisfying a cohomological boundary condition, providing a natural dual to Reifenberg's…

Analysis of PDEs · Mathematics 2016-06-03 J. Harrison , H. Pugh

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

Combinatorics · Mathematics 2022-12-20 Heather Smith Blake , Piotr Micek , William T. Trotter

The local theory of regular or multi-regular systems aims at finding sufficient local conditions for a Delone set $X$ to be a regular or multi-regular system. One of the main goals is to estimate the regularity radius $\hat{\rho}_d$ for…

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a…

Geometric Topology · Mathematics 2011-04-12 P. Lopes , J. Matias

In the 1960s, Erd\H{o}s and Gallai conjectured that the edge set of every graph on n vertices can be partitioned into O(n) cycles and edges. They observed that one can easily get an O(n log n) upper bound by repeatedly removing the edges of…

Combinatorics · Mathematics 2014-05-23 David Conlon , Jacob Fox , Benny Sudakov

An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical prediction that the count of zeros of holomorphic self-mappings of the complex linear space should be controlled by the maximum modulus function.…

Complex Variables · Mathematics 2024-11-20 Lev Buhovsky , Iosif Polterovich , Leonid Polterovich , Egor Shelukhin , Vukašin Stojisavljević

In 1960s, Almgren initiated a program to find minimal hypersurfaces in compact manifolds using min-max method. This program was largely advanced by Pitts and Schoen-Simon in 1980s when the manifold has no boundary. In this paper, we finish…

Differential Geometry · Mathematics 2017-08-25 Martin Li , Xin Zhou

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

One of the main problems of the theory of dynamical systems is the determination of the existence of periodic orbits of a self-map and more generally, the structure of the set of periods. Define the minimum period of a class os self-maps of…

Dynamical Systems · Mathematics 2012-04-03 Moira Chas

The Countable Telescope Conjecture arose in the framework of stable homotopy theory, as a tool conceived to study the chromatic filtration. It turned out, however, to trigger extremely fertile research within the framework of Module…

Rings and Algebras · Mathematics 2022-01-26 P. F. Pacchiarotti

In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove…

Differential Geometry · Mathematics 2009-04-10 Xin Zhou

It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2…

Computational Geometry · Computer Science 2014-04-11 Akitoshi Kawamura , Sonoko Moriyama , Yota Otachi , János Pach
‹ Prev 1 3 4 5 6 7 10 Next ›