中文
相关论文

相关论文: Book Ramsey numbers I

200 篇论文

For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…

Consider the smooth quadric Q_6 in P^7. The middle homology group H_6(Q_6,Z) is two-dimensional with a basis given by two classes of linear subspaces. We classify all threefolds of bidegree (1,p) inside Q_6.

代数几何 · 数学 2008-08-13 Lev Borisov , Jeff Viaclovsky

For a rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a rational square for all $1 \leqslant i < j \leqslant n$. For every $q$ we find all…

数论 · 数学 2025-12-30 Goran Dražić , Matija Kazalicki

We investigate the consecutive primes $p$ and $q$ ($p > q$) for which there exists a pair of natural numbers $(x,y)$ such that $p^x-q^y$ is a perfect square and make some conjectures.

数论 · 数学 2016-04-20 Alessandro Ventullo

Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey…

计算机科学中的逻辑 · 计算机科学 2020-01-15 Ronald de Haan , Jakub Szymanik

If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently…

组合数学 · 数学 2012-11-02 John Goldwasser , John Talbot

The n-th hull of a union of curves in R^3 is the set of points with the property: Any plane passing through the point intersects the curves at least 2n times. The hull number u(L) of a link L is defined as the minimum number of non-empty…

几何拓扑 · 数学 2007-05-23 Ivan Izmestiev

Some geometric structures with associated Riemannian metrics have been considered in the book.

微分几何 · 数学 2008-05-23 Alexander A. Ermolitsky

The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…

数学物理 · 物理学 2007-05-23 A. P. Yefremov

Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$…

环与代数 · 数学 2017-07-06 Clément de Seguins Pazzis

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

最优化与控制 · 数学 2024-08-30 Marius Costandin

Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…

数论 · 数学 2023-12-20 Yann Bugeaud , Khoa D. Nguyen

We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2 - r - 1)n - r + 1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint…

组合数学 · 数学 2016-05-25 Barnaby Roberts

We consider pyramids made of one-dimensional pieces of fixed integer length a and which may have pairwise overlaps of integer length from 1 to a. We prove that the number of pyramids of size m, i.e. consisting of m pieces, equals (am-1,m-1)…

组合数学 · 数学 2012-11-20 Bergfinnur Durhuus , Soren Eilers

We obtain a bound on the number of solutions of $x^q=x$ in a finite noncommutative algebra over a field with $q$ elements. Furthermore, we completely characterize those rings for which this maximum number is attained.

环与代数 · 数学 2020-09-28 Vineeth Chintala

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…

组合数学 · 数学 2013-01-03 David Conlon , Jacob Fox , János Pach , Benny Sudakov , Andrew Suk

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the…

组合数学 · 数学 2012-08-10 Yuanzhong Ou , Boli Wang , Min Yan

Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of…

组合数学 · 数学 2014-03-04 Gyula O. H. Katona , Dániel T. Nagy

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

数论 · 数学 2022-04-21 Leif Jacob , Burkhard Külshammer

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

组合数学 · 数学 2012-06-05 H. K. Kim , J. Y. Lee