中文
相关论文

相关论文: The minimum distance of sets of points and the min…

200 篇论文

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

交换代数 · 数学 2024-04-16 John Pawlina , Stefan Tohaneanu

Given a finite set of points $\Gamma$ in $\mathbb P^{k-1}$ not all contained in a hyperplane, the "fitting problem" asks what is the maximum number $hyp(\Gamma)$ of these points that can fit in some hyperplane and what is (are) the…

交换代数 · 数学 2012-04-09 Stefan O. Tohaneanu

A problem originating with Erd\H{o}s and Silverman in the 1970s asks for the minimum integer $r(k)$ such that any set of $n \ge r(k)$ points in the plane has some $k$-subset with no right angles. The case $k=4$ has an interesting gap…

组合数学 · 数学 2026-05-05 Peter J. Dukes

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

组合数学 · 数学 2020-04-24 Aaron Lin , Konrad Swanepoel

Let $K$ be a number field with the discriminant $D_K$ and the class number $h_{K}$, which has bounded degree over $\mathbb{Q}$. By assuming GRH, we prove that every ideal class of $K$ contains a prime ideal with norm less than…

数论 · 数学 2018-05-07 Naser T. Sardari

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

数论 · 数学 2024-04-09 Tanmoy Bera

Let $X$ be a locally symmetric space $\Gamma\backslash G/K$ where $G$ is a connected non-compact semisimple real Lie group with trivial centre, $K$ is a maximal compact subgroup of $G$, and $\Gamma\subset G$ is a torsion-free irreducible…

代数拓扑 · 数学 2015-05-20 Arghya Mondal , Parameswaran Sankaran

In part II we constructed the lower bound, in the spirit of $\Gamma$- $\liminf$ for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking the form E_\e(v):=\int_\Omega…

偏微分方程分析 · 数学 2013-09-26 Arkady Poliakovsky

Given $\Sigma\subset\mathbb K[x_1,\ldots,x_k]$, any finite collection of linear forms, some possibly proportional, and any $1\leq a\leq |\Sigma|$, it has been conjectured that $I_a(\Sigma)$, the ideal generated by all $a$-fold products of…

交换代数 · 数学 2019-06-07 Stefan O. Tohaneanu

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

偏微分方程分析 · 数学 2013-02-18 Arkady Poliakovsky

Let $\Gamma$ be a geometrically-finite Fuchsian group acting on the upper half plane $\hh.$ Let $\E$ denote the set of elliptic fixed points of $\Gamma$ in $\hh.$ We give a lower bound on the minimal hyperbolic distance between points in…

复变函数 · 数学 2016-03-25 Joshua S. Friedman

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

度量几何 · 数学 2020-09-16 Orit E. Raz

In this note, we prove that there exists a universal constant $c=\frac{43}{50}$ such that for every $k\in \mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least…

组合数学 · 数学 2019-04-09 Asaf Ferber , Vishesh Jain

A graph $\Gamma$ is said to be universal for a class of graphs $\mathcal{H}$ if $\Gamma$ contains a copy of every $H \in \mathcal{H}$ as a subgraph. The number of edges required for a host graph $\Gamma$ to be universal for the class of…

组合数学 · 数学 2025-12-01 Peter Allen , Julia Böttcher , Jasmin Katz

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

组合数学 · 数学 2016-11-23 Mark S. MacLean , Stefko Miklavic

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

组合数学 · 数学 2026-05-11 Jasmin Katz , Xiaopan Lian , Alexandru Malekshahian , Andrey Shapiro

We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…

最优化与控制 · 数学 2022-09-16 Steven B. Damelin , Michael Werman

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

组合数学 · 数学 2018-01-04 Martin Balko , Josef Cibulka , Pavel Valtr

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

组合数学 · 数学 2018-01-23 Lihang Hou , Bo Hou , Suogang Gao , Wei-Hsuan Yu

Let $\Gamma$ be a finitely generated subgroup of the multiplicative group $\G_m^2(\bar{Q})$. Let $p(X,Y),q(X,Y)\in\bat{Q}$ be two coprime polynomials not both vanishing at $(0,0)$; let $\epsilon>0$. We prove that, for all $(u,v)\in\Gamma$…

数论 · 数学 2007-05-23 Pietro Corvaja , Umberto Zannier
‹ 上一页 1 2 3 10 下一页 ›