English
Related papers

Related papers: A Structural Theorem for Sets With Few Triangles

200 papers

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Number Theory · Mathematics 2008-11-10 Viada Evelina

Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…

Logic · Mathematics 2019-01-11 Zachiri McKenzie

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin

In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…

Rings and Algebras · Mathematics 2007-05-23 L. A. Simonian

We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong…

Group Theory · Mathematics 2026-05-18 Kıvanç Ersoy

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…

Combinatorics · Mathematics 2013-03-01 Henning Bruhn , Oliver Schaudt

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…

Combinatorics · Mathematics 2025-03-04 Christopher Bouchard

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

Combinatorics · Mathematics 2010-09-23 Matthew Kahle

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…

Combinatorics · Mathematics 2024-03-11 Véronique Bruyère , Gwenaël Joret , Hadrien Mélot

Guth and Katz proved that any point set $\mathcal P$ in the plane determines $\Omega(|\mathcal P|/\log|\mathcal P|)$ distinct distances. We show that when near to this lower bound, a point set $\mathcal P$ of the form $A\times A$ must…

Combinatorics · Mathematics 2016-11-15 Brandon Hanson

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…

Combinatorics · Mathematics 2013-10-07 Oriol Serra , Gilles Zémor

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

Group Theory · Mathematics 2023-02-14 Marius Tărnăuceanu

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Combinatorics · Mathematics 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

In a series of papers [Pan0], [Pan1], [Pan2], [Pan3] we give a detailed and better structured proof of the Grothendieck--Serre's conjecture for semi-local regular rings containing a finite field. The outline of the proof is the same as in…

Algebraic Geometry · Mathematics 2017-07-06 Ivan Panin

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

Optimization and Control · Mathematics 2023-11-29 Alessio Figalli , Yi Ru-Ya Zhang

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

Combinatorics · Mathematics 2022-01-28 John T. Baldwin

Let $A$ be a $\sigma$-unital finite simple $C^*$-algebra which has strict comparison property. We show that if the canonical map $\Gamma$ from the Cuntz semigroup to certain lower semi-continuous affine functions is surjective, then $A$ has…

Operator Algebras · Mathematics 2024-02-21 Huaxin Lin

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang
‹ Prev 1 3 4 5 6 7 10 Next ›