中文
相关论文

相关论文: On an Erd\H{o}s-type conjecture on $\mathbb{F}_q[x…

200 篇论文

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

组合数学 · 数学 2016-05-25 Hao Huang , Yi Zhao

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

数论 · 数学 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

Each (equigenerated) squarefree monomial ideal in the polynomial ring $S=\mathbb{K}[x_1, \ldots, x_n]$ represents a family of subsets of $[n]$, called a (uniform) clutter. In this paper, we introduce a class of uniform clutters, called…

交换代数 · 数学 2018-07-31 Mina Bigdeli , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

Let R be a regular local ring. Let G be a reductive R-group scheme. A conjecture of Grothendieck and Serre predicts that a principal G-bundle over R is trivial if it is trivial over the quotient field of R. The conjecture is known when R…

代数几何 · 数学 2023-03-15 Roman Fedorov

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

组合数学 · 数学 2026-03-11 Tapas Kumar Mishra

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

组合数学 · 数学 2018-10-30 Václav Rozhoň

In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…

组合数学 · 数学 2024-04-03 Max Kölbl

Covering systems of the integers were introduced by Erd\H{o}s in 1950. Since then, many beautiful questions and conjectures about these objects have been posed. Most famously, Erd\H{o}s asked whether the minimum modulus of a covering system…

数论 · 数学 2024-08-21 Biao Wang

Erd\H{o}s, S\'ark\"ozy, and S\'os studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstra\"ete proposed a…

组合数学 · 数学 2026-01-26 Hyunwoo Lee , Chi Hoi Yip , Semin Yoo

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

组合数学 · 数学 2025-08-01 Michelle Delcourt , Cicely , Henderson , Thomas Lesgourgues , Luke Postle

In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…

组合数学 · 数学 2007-05-23 Sinisa T. Vrecica

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

组合数学 · 数学 2019-09-02 Archy Will He

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

代数几何 · 数学 2026-05-05 Enrico Savi

This paper establishes an analog of the Erd\H{o}s-Ko-Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins. A $k$-uniform family of subsets of a set of finite size $n$ is $l$-intersecting…

数论 · 数学 2024-10-25 Nika Salia , Dávid Tóth

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. Suppose the characteristic of $\mathbb{F}_q$ is not $2$ or $3$. In this paper, we prove an $\mathbb{F}_q[t]$-analogue of results…

数论 · 数学 2015-10-26 Wentang Kuo , Shuntaro Yamagishi

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such…

数论 · 数学 2024-10-22 Manjul Bhargava

The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an $N(q,d):=(q-1)(d+1)$-simplex to $d$-dimensional Euclidian space, the existence of $q$ pairwise disjoint subfaces whose images have…

组合数学 · 数学 2018-08-23 Steven Simon

Let $z\in\mathbb C^n$ and $\|z\|$ be its Euclidean norm. Ebenfelt proposed a conjecture regarding the possible ranks of the Hermitian polynomials in $z,\bar z$ of the form $A(z,\bar z)\|z\|^2$, known as the SOS Conjecture, where SOS stands…

复变函数 · 数学 2021-12-23 Yun Gao , Sui-Chung Ng

The Erd\H{o}s-S\'{o}s Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that Erd\H{o}s-S\'{o}s Conjecture is true for…

组合数学 · 数学 2014-03-24 Long-Tu Yuan , Xiao-Dong Zhang

A famous conjecture of P\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\'os, S\'ark\"ozy…

组合数学 · 数学 2016-11-28 Katherine Staden , Andrew Treglown