中文
相关论文

相关论文: A note on the no-three-in-line problem on a torus

200 篇论文

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

度量几何 · 数学 2017-06-22 Simeon Ball

Let $d\geq 2$ be an integer, $K_0$ a perfect field such that $char(K_0)$ does not divide $d$, $n > d$ an integer prime to $d$, $f(x)\in K_0[x]$ a degree $n$ monic polynomial without repeated roots, and $C_{f,d}$ a smooth projective model of…

代数几何 · 数学 2025-12-18 Boris Bekker , Yuri G. Zarhin

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

概率论 · 数学 2025-12-23 Arthur Blanc-Renaudie , Asaf Nachmias

We show that an effective action of the one-dimensional torus $\mathbb{G}_m$ on a normal affine algebraic variety $X$ can be extended to an effective action of a semi-direct product $\mathbb{G}_m\rightthreetimes\mathbb{G}_a$ with the same…

代数几何 · 数学 2024-03-19 Ivan Arzhantsev

The purpose of this work is to pursue classification of geproci sets. Specifically we classify $[m,n]$-geproci sets which consist of $m=4$ points on each of $n$ skew lines, assuming the skew lines have two transversals in common. We show…

We show that if a graph $G$ with $n \geq 3$ vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then $G$ has at most $6n-12$ edges. This settles a conjecture of Pach, Radoi\v{c}i\'{c},…

组合数学 · 数学 2019-03-26 Eyal Ackerman

We study the Tur\'{a}n numbers of $3$-graphs avoiding $3$-graphs $F$ and $M_{s+1}^3$, a matching of size $s+1$. We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journal of Combinatorics, 2025, 127:104155] on…

组合数学 · 数学 2025-11-24 Nannan Chen , Miao Liu , Yuzhen Qi , Caihong Yang

For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the tree on…

组合数学 · 数学 2014-10-28 Zhi-Hong Sun , Lin-Lin Wang

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

组合数学 · 数学 2021-03-09 S. Lawrencenko , T. Sulanke , M. T. Villar , L. V. Zgonnik , M. J. Chávez , J. R. Portillo

In this paper, we study orbit closures under diagonal torus actions. We show that if $(x,y)\in\mathbb{T}^2$ is not contained in any rational lines, then its orbit under the $\times 2, \times 3, \times 5$ actions is dense in $\mathbb{T}^2.$

动力系统 · 数学 2022-02-14 Han Yu

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

计算几何 · 计算机科学 2017-06-08 Sariel Har-Peled , Mitchell Jones

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

组合数学 · 数学 2015-06-15 Daniel Horsley , Rosalind A. Hoyte

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

组合数学 · 数学 2013-06-04 M. J. Chávez , S. Lawrencenko , A. Quintero , M. T. Villar

This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…

偏微分方程分析 · 数学 2026-05-04 Anouar Bahrouni

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

几何拓扑 · 数学 2025-08-25 Ferit Öztürk

In this paper we study the number $M_{m,n}$ of ways to place nonattacking pawns on an $m\times n$ chessboard. We find an upper bound for $M_{m,n}$ and analyse its asymptotic behavior. It turns out that $\lim_{m,n\to\infty}(M_{m,n})^{1/mn}$…

组合数学 · 数学 2007-05-23 S. Kitaev , T. Mansour

Let a $k$-dimensional torus $T^k$ act on a $2n$-dimensional compact connected almost complex manifold $M$ with isolated fixed points. As for circle actions, we show that there exists a (directed labeled) multigraph that encodes weights at…

微分几何 · 数学 2022-02-23 Donghoon Jang

We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…

组合数学 · 数学 2014-12-05 János Kollár

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

组合数学 · 数学 2011-05-23 Jim Geelen , Peter Nelson

If a finite group of orientation-preserving diffeomorphisms of the 3-dimensional torus leaves invariant an oriented, closed, embedded surface of genus g>1 and preserves the orientation of the surface, then its order is bounded from above by…

几何拓扑 · 数学 2018-04-10 Chao Wang , Bruno Zimmermann