English
Related papers

Related papers: Lehmer's Problem, McKay's Correspondence, and $2,3…

200 papers

It is a classical result of Mahler that for any rational number $\alpha$ > 1 which is not an integer and any real 0 < c < 1, the set of positive integers n such that $\alpha$ n < c n is necessarily finite. Here for any real x, x denotes the…

Number Theory · Mathematics 2019-04-02 Patrice Philippon , Purusottam Rath

Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…

Mathematical Physics · Physics 2015-06-15 J. A. de Azcarraga , J. M. Izquierdo

Maximum likelihood estimation (MLE) is a fundamental problem in statistics. Characteristics of the MLE problem for discrete algebraic statistical models are reflected in the geometry of the $\textit{likelihood correspondence}$, a variety…

Statistics Theory · Mathematics 2024-11-19 David Barnhill , John Cobb , Matthew Faust

A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 2002, Exoo found a (3, 14) record graph with order 384. The…

Combinatorics · Mathematics 2017-06-27 Vivek S. Nittoor

Following ideas of Iriyeh and Shibata we give a short proof of the three-dimensional Mahler conjecture {\mf for symmetric convex bodies}. Our contributions include, in particular, simple self-contained proofs of their two key statements.…

Metric Geometry · Mathematics 2021-01-21 Matthieu Fradelizi , Alfredo Hubard , Mathieu Meyer , Edgardo Roldán-Pensado , Artem Zvavitch

In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$…

Combinatorics · Mathematics 2013-11-19 Tom Brown , Veselin Jungić , Andrew Poelstra

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

Number Theory · Mathematics 2026-05-22 Cheng-TIng Wang

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H contains all n edges of the form {x_i,x_{i+1},...,x_{i+k-1}}. Let…

Combinatorics · Mathematics 2012-06-19 Guy Moshkovitz , Asaf Shapira

Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find a coarse analogue of Menger's theorem, which characterizes…

Combinatorics · Mathematics 2025-08-21 Tung Nguyen , Alex Scott , Paul Seymour

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

Optimization and Control · Mathematics 2010-10-07 Gennadiy Averkov , Robert Weismantel

We study geometric representations of GL(n,R) for a ring R. The structure of the associated Hecke algebras is analyzed and shown to be cellular. Multiplicities of the irreducible constituents of these representations are linked to the…

Representation Theory · Mathematics 2007-05-23 Uri Bader , Uri Onn

We study different problems related to the Solomon's descent algebra $\Sigma(W)$ of a finite Coxeter group $(W,S)$: positive elements, morphisms between descent algebras, Loewy length... One of the main result is that, if $W$ is irreducible…

Representation Theory · Mathematics 2008-05-30 Cédric Bonnafé , Götz Pfeiffer

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Combinatorics · Mathematics 2024-02-06 Oliver Janzer , Benny Sudakov

These three topics are an attempt to explicate some curiosities of the inverse problem of representation theory (i.e. having a set of operators to describe the "correct" algebraic object, which is represented by them) on simple examples…

High Energy Physics - Theory · Physics 2008-02-03 Denis Juriev

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…

Combinatorics · Mathematics 2012-10-12 Tuvi Etzion

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

Number Theory · Mathematics 2019-08-26 Ryan Alweiss , Sammy Luo

The main result is a direct proof of the implication $(LVKF_{k,3})\Rightarrow( LT_{3k-1,3})$ below. Consider the following statements: ($LVKF_{1,3}$) From any 11 points in $ \mathbb{R}^{3}$ one can choose 3 pairwise disjoint triples whose…

Geometric Topology · Mathematics 2020-07-14 Egor Kolpakov

In this paper, first we introduce the notions of 3-tri-Leibniz algebras and embedding tensors on 3-Leibniz algebras. We show that an embedding tensor gives rise to a 3-tri-Leibniz algebra. Conversely, a 3-tri-Leibniz algebra gives rise to a…

Rings and Algebras · Mathematics 2025-02-07 Wen Teng , Shuangjian Guo

Let $L$ be a primitive Gaussian line, that is, a line in the complex plane that contains two, and hence infinitely many, coprime Gaussian integers. We prove that there exists an integer $G_L$ such that for every integer $n\geq G_L$ there…

Number Theory · Mathematics 2022-07-04 Elsa Magness , Brian Nugent , Leanne Robertson

In this paper we introduce and study the Minimum Edge Compact Spanner~(MECS) problem. We prove hardness results related to the problem, design exact and greedy algorithms for solving the problem, and show related experimental results. The…

Discrete Mathematics · Computer Science 2017-12-13 Tathagata Mukherjee , Alexander Veremyev , Piyush Kumar , Eduardo Pasiliao
‹ Prev 1 8 9 10 Next ›