中文
相关论文

相关论文: Three Dimensional Corners: A Box Norm Proof

200 篇论文

The main result of this article states that the (K;N)-cone over some metric measure space satisfies the reduced Riemannian curvature-dimension condition RCD^*(KN;N+1) if and only if the underlying space satisfies RCD^*(N-1;N). The proof…

度量几何 · 数学 2014-10-10 Christian Ketterer

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

组合数学 · 数学 2019-07-22 Coen del Valle , Peter J. Dukes

We prove that 3-query linear locally correctable codes over the Reals of dimension $d$ require block length $n>d^{2+\lambda}$ for some fixed, positive $\lambda >0$. Geometrically, this means that if $n$ vectors in $R^d$ are such that each…

计算复杂性 · 计算机科学 2013-11-21 Zeev Dvir , Shubhangi Saraf , Avi Wigderson

Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G.…

数论 · 数学 2016-08-23 Avner Ash , Paul E. Gunnells , Mark McConnell , Dan Yasaki

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

经典分析与常微分方程 · 数学 2026-03-09 Samantha Sandberg-Clark , Krystal Taylor

We establish the Noether inequality \[\textrm{Vol}(X)\geq \frac{4}{3}p_g(X)-\frac{10}{3}\] for all projective $3$-folds $X$ of general type with geometric genus $5\leq p_g(X)\leq 10$ where $\textrm{Vol}(X)$ is the canonical volume. This…

代数几何 · 数学 2025-08-26 Meng Chen , Yong Hu , Chen Jiang

We prove that the cardinality of the torsion subgroups in homology of a closed hyperbolic manifold of any dimension can be bounded by a doubly exponential function of its diameter. It would follow from a conjecture by Bergeron and Venkatesh…

几何拓扑 · 数学 2017-09-07 Bram Petri

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

代数几何 · 数学 2015-09-22 Saugata Basu , Martin Sombra

A \textit{$3$-net} of order $n$ is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with…

群论 · 数学 2016-03-02 Gábor Korchmáros , Gábor P. Nagy

A finite Euclidean set is diameter-Ramsey if, for every number of colors, some finite same-diameter witness has the property that every coloring of the witness contains a monochromatic congruent copy of the set. Frankl, Pach, Reiher and…

组合数学 · 数学 2026-04-27 Yaping Mao

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

几何拓扑 · 数学 2007-05-23 Marc Lackenby

A semidomain is a subsemiring of an integral domain. We call a semidomain $S$ additively reduced if $0$ is the only invertible element of the monoid $(S, +)$, while we say that $S$ is additively Furstenberg if every non-invertible element…

交换代数 · 数学 2024-12-24 Eddy Li , Advaith Mopuri , Charles Zhang

In this paper we prove the strong Sard conjecture for sub-Riemannian structures on 3-dimensional analytic manifolds. More precisely, given a totally nonholonomic analytic distribution of rank 2 on a 3-dimensional analytic manifold, we…

微分几何 · 数学 2018-10-17 A Belotto da Silva , A Figalli , A Parusiński , L Rifford

We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…

计算复杂性 · 计算机科学 2017-09-07 Joshua A. Grochow

The size Ramsey number $ \hat{r}(G,H) $ of two graphs $ G $ and $ H $ is the smallest integer $ m $ such that there exists a graph $ F $ on $ m $ edges with the property that every red-blue colouring of the edges of $ F $, yields a red copy…

组合数学 · 数学 2016-09-14 Meysam Miralaei , Gholamreza Omidi , Maryam Shahsiah

Up until now, it was recognized that a large number of 2-torsion points was a technical barrier to improve the bounds for the symmetric tensor rank of multiplication in every extension of any finite field. In this paper, we show that there…

代数几何 · 数学 2014-09-12 Stéphane Ballet , Julia Pieltant

Hadwiger's transversal theorem gives necessary and sufficient conditions for a family of convex sets in the plane to have a line transversal. A higher dimensional version was obtained by Goodman, Pollack and Wenger, and recently a colorful…

度量几何 · 数学 2013-10-17 Andreas F. Holmsen , Edgardo Roldán-Pensado

We show that the Cheeger constant of compact surfaces is bounded by a function of the area. We apply this to isoperimetric profiles of bounded genus non-compact surfaces, to show that if their isoperimetric profile grows faster than $\sqrt…

微分几何 · 数学 2007-07-02 Panos Papasoglu

The concept of symmetry breaking has been a propelling force in understanding phases of matter. While rotational symmetry breaking is one of the most prevalent examples, the rich landscape of orientational orders breaking the rotational…

软凝聚态物质 · 物理学 2016-08-24 Jaakko Nissinen , Ke Liu , Robert-Jan Slager , Kai Wu , Jan Zaanen

Denote by $R(G_1, G_2, G_3)$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_i$ coloured with colour $i$ for some $i\in{1,2,3}$. In a…

组合数学 · 数学 2015-08-31 David G. Ferguson