English
Related papers

Related papers: Loops with exponent three in all isotopes

200 papers

Let $Q$ be a Buchsteiner loop. We describe the associator calculus in three variables, and show that $|Q| \ge 32$ if $Q$ is not conjugacy closed. We also show that $|Q| \ge 64$ if there exists $x \in Q$ such that $x^2$ is not in the nucleus…

Group Theory · Mathematics 2008-12-03 Ales Drapal , Michael Kinyon

We prove the exponent $4/3$ for the lattice point discrepancy of a torus in $\mathbb{R}^3$ (generated by the rotation of a circle around the $z$ axis). The exponent comes from a diagonal term and it seems a natural limit for any approach…

Number Theory · Mathematics 2014-12-19 Fernando Chamizo , Dulcinea Raboso

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Representation Theory · Mathematics 2021-07-15 Harm Derksen , Visu Makam

For sufficiently large n Ramanujan gave a sufficient condition for the truth Robin's InEquality $X(n):=\frac{\sigma(n)}{n\ln\ln n}<e^{\gamma}$ (RIE). The largest known violation of RIE is $n_8=5040$. In this paper Robin's multipliers are…

Number Theory · Mathematics 2013-08-27 Thomas Schwabhäuser

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

Dynamical Systems · Mathematics 2023-09-15 Darren Creutz , Ronnie Pavlov

A recent proposal was made for a large representation rank limit for which the expectation values of N = 4 super Yang-Mills Wilson loops are given by the exponential of the 1-loop result. We verify the validity of this exponentiation in the…

High Energy Physics - Theory · Physics 2019-06-28 Diego H. Correa , Fidel I. Schaposnik Massolo

Let $F$ be a non-archimedean local field. Let $\Pi$ be a principal series representation of $\mathrm{GL}_n(F)$ induced from an irreducible cuspidal representation of a Levi subgroup. When $\pi$ is an essentially square integrable…

Representation Theory · Mathematics 2024-12-04 Mohammed Saad Qadri

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

We show that a closed piecewise-linear hypersurface immersed in $R^n$ ($n\ge 3$) is the boundary of a convex body if and only if every point in the interior of each $(n-3)$-face has a neighborhood that lies on the boundary of some convex…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point a radius around which A is conical. We obtain this result by combining famous results from…

Databases · Computer Science 2007-05-23 Floris Geerts

The loop $O(n)$ model is a family of probability measures on collections of non-intersecting loops on the hexagonal lattice, parameterized by a loop-weight $n$ and an edge-weight $x$. Nienhuis predicts that, for $0 \leq n \leq 2$, the model…

Probability · Mathematics 2024-06-17 Nicholas Crawford , Alexander Glazman , Matan Harel , Ron Peled

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

Combinatorics · Mathematics 2011-10-13 Nathan Linial , Zur Luria

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Group Theory · Mathematics 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber

A group of isometries of a hyperbolic $n$-space is called a reflection group if it is generated by reflections in hyperbolic hyperplanes. Vinberg gave a semi-algorithm for finding a maximal reflection sublattice in a given arithmetic…

Geometric Topology · Mathematics 2022-07-15 Mikhail Belolipetsky , Michael Kapovich

Let $\theta > 11/20$. We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n = p_1 + p_2 + p_3$ with $|p_i - n/3| \leq n^{\theta}$ for $i\in\{1,2,3\}$.

Number Theory · Mathematics 2017-05-04 Kaisa Matomäki , James Maynard , Xuancheng Shao

We derive a formula expressing the average number $E_n$ of real lines on a random hypersurface of degree $2n-3$ in $\mathbb{R}\textrm{P}^n$ in terms of the expected modulus of the determinant of a special random matrix. In the case $n=3$ we…

Algebraic Geometry · Mathematics 2016-11-09 Saugata Basu , Antonio Lerario , Erik Lundberg , Chris Peterson

If R is a local ring of dimension n, of a smooth complex variety, and if I is a zero dimensional ideal in R, then we prove that e(I)\geq n^n/lc(I)^n. Here e(I) is the Samuel multiplicity along I, and lc(I) is the log canonical threshold of…

Algebraic Geometry · Mathematics 2007-05-23 Tommaso de Fernex , Lawrence Ein , Mircea Mustata

Suppose that $S \subseteq [n]^2$ contains no three points of the form $(x,y), (x,y+\delta), (x+\delta,y')$, where $\delta \neq 0$. How big can $S$ be? Trivially, $n \le |S| \le n^2$. Slight improvements on these bounds are obtained from…

Combinatorics · Mathematics 2023-09-12 Kevin Pratt

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Number Theory · Mathematics 2025-10-20 Harry Altman , Juan Arias de Reyna