中文
相关论文

相关论文: Loops with exponent three in all isotopes

200 篇论文

This paper is a contribution to the investigation of closed partition relations for pairs of countable ordinals. As our main result, we prove that \[\omega^4 \cdot (n-2)+1 < R^{cl}(\omega \cdot n+1,3)<\omega^5\] for every integer $n \geq…

Half a century ago Manin showed that given a number field $k$ and a rational prime $\ell$, there exists a uniform bound for the order of cyclic $\ell$-power isogenies between two non-CM elliptic curves over $k$. We generalize this to…

数论 · 数学 2026-02-27 Mladen Dimitrov , Dinakar Ramakrishnan

There exist pairs of orthogonal Latin squares of any order n except if n=2 or n=6 [Bose, Shrikhande and Parker, 1960]. In particular, the problem of Euler's thirty-six officers does not have a solution. However, it has a "quantum solution":…

量子物理 · 物理学 2026-03-04 Simeon Ball , Robin Simoens

The study of the cone of submodular functions goes back to Jack Edmonds' seminal 1970 paper, which already highlighted the difficulty of characterizing its extreme rays. Since then, researchers from diverse fields have sought to…

组合数学 · 数学 2026-03-25 Georg Loho , Arnau Padrol , Germain Poullot

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

数论 · 数学 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

Given a binary quasigroup $G$ of order $n$, a $d$-iterated quasigroup $G[d]$ is the $(d+1)$-ary quasigroup equal to the $d$-times composition of $G$ with itself. The Cayley table of every $d$-ary quasigroup is a $d$-dimensional latin…

组合数学 · 数学 2021-08-20 Anna A. Taranenko

The classic trisecant lemma states that if $X$ is an integral curve of $\PP^3$ then the variety of trisecants has dimension one, unless the curve is planar and has degree at least 3, in which case the variety of trisecants has dimension 2.…

代数几何 · 数学 2017-12-05 J. Y. Kaminski , A. Kanel-Belov , M. Teicher

We show that a tree of order $n$ has at most $O(5^{n/4})$ nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomorphic rooted subtrees of a rooted tree.

组合数学 · 数学 2016-01-06 Éva Czabarka , László A. Székely , Stephan Wagner

Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…

组合数学 · 数学 2018-01-10 Nevena Francetić , Sarada Herke , Ian M. Wanless

Constructive and nonconstructive techniques are employed to enumerate Latin squares and related objects. It is established that there are (i) 2036029552582883134196099 main classes of Latin squares of order 11; (ii)…

组合数学 · 数学 2010-02-08 Alexander Hulpke , Petteri Kaski , Patric R. J. Östergård

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…

信息论 · 计算机科学 2026-05-06 Peter Boyvalenkov , Ferruh Ozbudak , Maya Stoyanova

The equational complexity function $\beta_\mathscr{V}:\mathbb{N}\to\mathbb{N}$ of an equational class of algebras $\mathscr{V}$ bounds the size of equation required to determine membership of $n$-element algebras in $\mathscr{V}$. Known…

群论 · 数学 2021-01-05 Marcel Jackson

Generalizing a recent construction of Yang and Yu, we study to what extent one can intersect Hassett's Noether-Lefschetz divisors $\mathcal{C}_d$ in the moduli space of cubic fourfolds $\mathcal{C}$. In particular, we exhibit arithmetic…

代数几何 · 数学 2020-05-12 Hanine Awada

We prove that for any linear 3-graph on $n$ vertices without a path of length 5, the number of edges is at most $\frac{15}{11}n$, and the equality holds if and only if the graph is the disjoint union of $G_0$, a graph with 11 vertices and…

组合数学 · 数学 2026-01-28 Chaoliang Tang , Hehui Wu , Junchi Zhang

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

数论 · 数学 2016-01-20 Terence Tao

The well-known quadrangle criterion states that a latin square is isotopic to the Cayley table of a group if and only if all quadrangles spanned by the same triple of symbols coincide on the fourth symbol. Gowers and Long (2020)…

组合数学 · 数学 2026-04-02 Anna A. Taranenko

We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.

经典分析与常微分方程 · 数学 2010-03-16 Sergei Yakovenko

If $\lambda$ is a positive real number strictly less than $\log3$, there is a positive number $V_\lambda$ such that every orientable hyperbolic 3-manifold of volume greater than $V_\lambda$ admits $\lambda$ as a Margulis number. If…

几何拓扑 · 数学 2010-10-14 Peter B. Shalen

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

组合数学 · 数学 2018-12-05 Stefan Glock

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

数论 · 数学 2026-05-20 Peter J. Campbell