English
Related papers

Related papers: The Existence of Minimal Logarithmic Signatures fo…

200 papers

In this paper, we prove that a closed minimal hypersurface in $\SSS$ with $\lambda_1<n$ has Morse index at least $n+4$, providing a partial answer to a conjecture of Perdomo. As a corollary, we re-obtain a partial proof of the famous Urbano…

Differential Geometry · Mathematics 2024-05-20 Hang Chen , Peng Wang

We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…

Geometric Topology · Mathematics 2022-07-07 Mikolaj Fraczyk , Lam L. Pham

In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm.…

Cryptography and Security · Computer Science 2017-06-16 Iharantsoa Vero Raharinirina

The Liebeck-Nikolov-Shalev conjecture [LNS12] asserts that, for any finite simple non-abelian group $G$ and any set $A\subseteq G$ with $|A|\geq 2$, $G$ is the product of at most $N\frac{\log|G|}{\log|A|}$ conjugates of $A$, for some…

Group Theory · Mathematics 2024-09-18 Daniele Dona

Hans J. Zassenhaus conjectured that for any unit $u$ of finite order in the integral group ring of a finite group $G$ there exists a unit $a$ in the rational group algebra of $G$ such that $a^{-1}\cdot u \cdot a=\pm g$ for some $g\in G$. We…

Rings and Algebras · Mathematics 2017-11-21 Florian Eisele , Leo Margolis

We study the existence of unitriangular basic sets for the symmetric group which behave nicely with respect to the Mullineux involution. Such sets give a natural labelling for the modular irreducible representations. We show that, for any…

Combinatorics · Mathematics 2021-11-23 Ana Bernal

Thurston's Ending Lamination Conjecture states that a hyperbolic 3-manifold N with finitely generated fundamental group is uniquely determined by its topological type and its end invariants. In this paper we prove this conjecture for…

Geometric Topology · Mathematics 2011-03-10 Jeffrey F. Brock , Richard D. Canary , Yair N. Minsky

We prove a variety of results concerning singular sets of reals. Our results concern: Kysiak and Laver-null sets, Kocinac and gamma-k-sets, Fleissner and square Q-sets, Alikhani-Koopaei and minimal Q-like-sets, Rubin and sigma-sets, and…

Logic · Mathematics 2007-05-23 Arnold W. Miller

In this paper, we give a sufficient and necessary condition for a regular element of a quantum cluster algebra $\mathcal{O}_q(\mathcal{X})$ to be universally polynomial. This resolves several conjectures by the first author on the…

Quantum Algebra · Mathematics 2023-02-09 Ivan Chi-Ho Ip , Jeff York Ye

We shall show that for a given homeomorphism type and a set of end invariants (including the parabolic locus) with necessary topological conditions which a topologically tame Kleinian group with that homeomorphism type must satisfy, there…

Geometric Topology · Mathematics 2014-11-11 Ken'ichi Ohshika

We study the capabilities of probabilistic finite-state machines that act as verifiers for certificates of language membership for input strings, in the regime where the verifiers are restricted to toss some fixed nonzero number of coins…

Computational Complexity · Computer Science 2026-04-21 M. Utkan Gezer , A. C. Cem Say

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

Group Theory · Mathematics 2007-05-23 Robert M. Guralnick , Martin Lorenz

Let G be a finite group, Irr(G) the set of all irreducible complex characters of G and X \in Irr(G). Let also cod(X) = |G : kerX|/X(1) and cod(G) = {cod(X) | X \in Irr(G)}. In this note, we show that the simple group PSL(2, q), for a prime…

Group Theory · Mathematics 2026-02-18 Afsane Bahri , Zeinab Akhlaghi , Behrooz Khosravi

We consider a square random matrix made by i.i.d. rows with any distribution and prove that, for any given dimension, the probability for the least singular value to be in [0; $\epsilon$) is at least of order $\epsilon$. This allows us to…

Probability · Mathematics 2020-04-16 Matteo Gregoratti , Davide Maran

Let $(X/Z,B+A)$ be a $\Q$-factorial dlt pair where $B,A\ge 0$ are $\Q$-divisors and $K_X+B+A\sim_\Q 0/Z$. We prove that any LMMP$/Z$ on $K_X+B$ with scaling of an ample$/Z$ divisor terminates with a good log minimal model or a Mori fibre…

Algebraic Geometry · Mathematics 2012-04-25 Caucher Birkar

In this paper, we introduce the notion of the universe, induced communities, and cells with their corresponding spots. Using this language, we formulate and prove the union close set conjecture by showing that for any finite universe…

General Mathematics · Mathematics 2026-03-10 Theophilus Agama

The main aim of this article is to establish a classification of simple polyadic groups in terms of ordinary groups and their automorphisms. We give two different definitions of simpleness for polyadic groups, from the point of views of…

Group Theory · Mathematics 2012-03-12 H. Khodabandeh , M. Shahryari

We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is…

Logic in Computer Science · Computer Science 2023-07-12 Jan Martens , Jan Friso Groote

Let $G$ be the simple algebraic group $\mathrm{SL}_2$ defined over an algebraically closed field $k$ of characteristic $p > 0$. Using results of A. Parker, we develop a method which gives, for any $q \in \mathbb{N}$, a closed form…

Representation Theory · Mathematics 2014-11-06 John Rizkallah

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

Computational Complexity · Computer Science 2012-04-18 S. Jukna , G. Schnitger
‹ Prev 1 8 9 10 Next ›