中文
相关论文

相关论文: Maximum rank webs are not necessarily almost Grass…

200 篇论文

Every open manifold L of dimension greater than one has complete Riemannian metrics g with bounded geometry such that (L,g) is not quasi-isometric to a leaf of a codimension one foliation of a closed manifold. Hence no conditions on the…

几何拓扑 · 数学 2009-11-25 Paul A. Schweitzer

We prove for various finite groups $G$ and integers $n\geq 1$ that there are families of equations with Galois group $G$ that cannot be simplified to a one-parameter family even after adjoining a root of a polynomial of degree at most $n$.…

代数几何 · 数学 2025-10-28 Benson Farb , Jesse Wolfson

We show that any almost complex structure, positively tamed with $\omega$ on nearly K\"{a}hler 6-manifold $(M,g,J,\omega)$ is not integrable

微分几何 · 数学 2013-05-07 Natalia Daurtseva

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

概率论 · 数学 2020-05-11 Shankar Bhamidi , Souvik Dhara , Remco van der Hofstad , Sanchayan Sen

Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…

组合数学 · 数学 2021-07-01 Asaf Ferber , Kyle Luh , Gweneth McKinley

Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\Delta\ge 32$. We prove that $\chi_{\ell}(G^2)\le \Delta+3$. For arbitrarily large maximum degree $\Delta$, there exist planar graphs $G_{\Delta}$ of girth 6…

组合数学 · 数学 2017-06-14 Daniel W. Cranston , Bobby Jaeger

Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with matching number at least $\ell$. In a previous paper by the authors, a generalization was…

组合数学 · 数学 2017-09-05 Kristóf Bérczi , András Frank

Let $G$ be a bipartite graph without loops and multiple edges on $v\ge 4$ vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove that such graph has at most $3v-8$ edges for even $v\ne 6$…

组合数学 · 数学 2014-05-29 Dmitri Karpov

This article tackles the problem of existence and classification of maximal growth distributions on smooth manifolds. We show that maximal growth distributions of rank$>2$ abide by a full $h$-principle in all dimensions. We make use of M.…

几何拓扑 · 数学 2023-08-22 Javier Martínez-Aguinaga

We derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…

复变函数 · 数学 2021-03-25 Gautam Bharali

We introduce the decomposition rank, a notion of covering dimension for nuclear C^*-algebras. The decomposition rank generalizes ordinary covering dimension and has nice permanence properties; in particular, it behaves well with respect to…

算子代数 · 数学 2007-05-23 Eberhard Kirchberg , Wilhelm Winter

The Hadamard rank of a point with respect to a projective variety is, if it exists, the minimum number of points of the variety whose coordinate-wise product is the given point. We classify the projective varieties for which the Hadamard…

代数几何 · 数学 2026-04-01 Dario Antolini , Edoardo Ballico , Alessandro Oneto

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

组合数学 · 数学 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…

组合数学 · 数学 2025-12-29 David Pask

For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…

几何拓扑 · 数学 2015-10-19 Inasa Nakamura

We construct a geodesic net in the plane with four boundary (unbalanced) vertices that has 25 balanced vertices and that is irreducible, i.e. it does not contain nontrivial subnets. This net is novel and remarkable for several reasons: (1)…

度量几何 · 数学 2025-11-12 Fabian Parsch , Hanrui Zhang

We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear…

离散数学 · 计算机科学 2014-07-09 Binh-Minh Bui-Xuan , Mamadou Moustapha Kanté , Vincent Limouzy

We present a projectively invariant description of planar linear 3-webs. For a non-hexagonal 3-web, we introduce family of projective torsion-free Cartan connections, the web leaves being geodesics for each member of the family, and give a…

微分几何 · 数学 2019-03-05 Sergey I. Agafonov

In this paper we study a homological version of the higher-dimensional divergence invariants defined by Brady and Farb. We show that they are quasi-isometry invariants in the class of proper cocompact Hadamard spaces in the sense of…

微分几何 · 数学 2007-05-23 Stefan Wenger

Any nonpositively curved symmetric space admits a topological compactification, namely the Hadamard compactification. For rank one spaces, this topological compactification can be endowed with a differentiable structure such that the action…

微分几何 · 数学 2010-06-24 Benoit Kloeckner