English
Related papers

Related papers: There are no realizable 15_4- and 16_4-configurati…

200 papers

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

Logic · Mathematics 2010-07-06 Elisabetta Pastori , Pablo Spiga

We show that there exist an upper bound and a lower bound for the number of non-degenerate central configurations of the n-body problem in the plane with a homogeneous potential. In particular, both bounds are independent of the homogeneous…

Dynamical Systems · Mathematics 2025-02-28 Julius Natrup , Qun Wang , Yuchen Wang

An effective search bound is established for the least non-trivial integer zero of an arbitrary integral cubic form in at least 17 variables.

Number Theory · Mathematics 2009-07-31 T. D. Browning , R. Dietmann , P. D. T. A. Elliott

The singular and regular type of a point on a real hypersurface $\mathcal H$ in $\mathbb C^n$ are shown to agree when the regular type is strictly less than 4. If $\mathcal H$ is pseudoconvex, we show they agree when the regular type is 4.…

Complex Variables · Mathematics 2019-11-15 Jeffery D. McNeal , Luka Mernik

We prove the non integrability of the colinear $3$ and $4$ body problem, for any masses positive masses. To deal with resistant cases, we present strong integrability criterions for $3$ dimensional homogeneous potentials of degree $-1$, and…

Dynamical Systems · Mathematics 2015-09-29 Thierry Combot

We present the solution of a century-old problem known as Schur Number Five: What is the largest (natural) number $n$ such that there exists a five-coloring of the positive numbers up to $n$ without a monochromatic solution of the equation…

Logic in Computer Science · Computer Science 2017-11-23 Marijn J. H. Heule

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines. We…

Combinatorics · Mathematics 2014-01-14 Ben D. Lund , George B. Purdy , Justin W. Smith

We provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…

Computational Complexity · Computer Science 2025-07-03 Fabian Egidy , Christian Glaßer

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size $n$ using pairwise comparisons if $k$ of the comparisons might be erroneous where $k$ is a fixed constant. We prove…

Discrete Mathematics · Computer Science 2011-11-15 Dömötör Pálvölgyi

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

Combinatorics · Mathematics 2024-09-11 Jorge Garcia , Rosemarie Bongers , Jonathan Detgen , Walter Morales

We construct infinitely many pairwise non-diffeomorphic smooth structures on a definite $4$-manifold with non-cyclic fundamental group $\mathbb{Z}/2\times \mathbb{Z}/2$.

Geometric Topology · Mathematics 2024-06-11 Robert Harris , Patrick Naylor , B. Doug Park

We construct exactly solvable models for four particles moving on a real line or on a circle with translation invariant two- and four-particle interactions.

High Energy Physics - Theory · Physics 2007-05-23 Oliver Haschke , Werner Ruehl

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

Logic · Mathematics 2014-11-26 Márton Elekes , Tamás Keleti

For any integer $n\geq 2$, we construct an infinite family of Stein fillable contact $(4n-1)$-manifolds each of which admits infinitely many pairwise homotopy inequivalent Stein fillings.

Geometric Topology · Mathematics 2016-11-18 Takahiro Oba

Adapting Cantor set methods that were used by Hall and Hlawka for regular continued fractions, we prove that every real number can be obtained as the sum of two real numbers for which the partial fractions in their nearest integer continued…

Number Theory · Mathematics 2025-03-20 Wieb Bosma , Alex Brouwers

In this paper we present four necessary and sufficient conditions for a natural number to be prime.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We study Lie rings definable in a finite-dimensional theory, extending the results for the finite Morley rank case. In particular, we prove a classification of Lie rings of dimension up to four in the NIP or connected case. In…

Logic · Mathematics 2025-11-11 Moreno Invitti

We consider the finiteness problem for central configurations of the $n-$body problem. We prove that, for $n\geq4$, there exists a (Zariski) closed subset $B$ in the mass space $\mathbb{R}^{n}$, such that if $(m_1,...,m_n) \in…

Dynamical Systems · Mathematics 2016-08-22 Thiago Dias

We give information about finite-dimensional Lie algebras and their representations for model building in 4 and 5 dimensions; e.g., conjugacy classes, types of representations, Weyl dimensional formulas, Dynkin indices, quadratic Casimir…

High Energy Physics - Phenomenology · Physics 2020-08-18 Naoki Yamatsu

Theory of $n$-complements with applications is presented.

Algebraic Geometry · Mathematics 2020-12-14 V. V. Shokurov
‹ Prev 1 8 9 10 Next ›