中文
相关论文

相关论文: Infinite Simple Bol Loops

200 篇论文

We show that certain orderable groups admit no isolated left orders. The groups we consider are cyclic amalgamations of a free group with a general orderable group, the HNN extensions of free groups over cyclic subgroups, and a particular…

群论 · 数学 2018-12-19 Juan Alonso , Joaquin Brum

In this note, it is proved the existence of an infinitely generated multiplicative group consisting of entire functions that are, except for the constant function 1, hypercyclic with respect to the convolution operator associated to a given…

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

综合物理 · 物理学 2007-05-23 Gordon Chalmers

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

群论 · 数学 2021-09-14 Grechkoseeva Mariya

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

表示论 · 数学 2007-05-23 G. Lusztig

We give a construction that in many cases gives a simple way to construct infinite families of algebras that are not Morita equivalent, but are all derived equivalent to the same block algebra of a finite group, and apply it to some small…

表示论 · 数学 2013-10-10 Jeremy Rickard

We provide the law of large numbers for roots of finite free multiplicative convolution of polynomials which have only non-negative real roots. Moreover, we study the empirical root distributions of limit polynomials obtained through the…

概率论 · 数学 2023-01-18 Katsunori Fujie , Yuki Ueda

We associate an integer to any simple polytope and we study its properties.

组合数学 · 数学 2011-10-04 Bosio Frédéric

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

计算机科学中的逻辑 · 计算机科学 2026-05-15 Mishel Carelli

This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to moving jumps (attachments) of par units…

逻辑 · 数学 2007-05-23 Dominic Hughes

We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…

群论 · 数学 2016-09-13 Max Forester

We construct affine algebras with an arbitrary amount of simple modules of each dimension.

环与代数 · 数学 2015-12-17 Be'eri Greenfeld

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

数论 · 数学 2025-03-07 Alina Ostafe , Carl Pomerance , Igor E. Shparlinski

We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.

群论 · 数学 2021-02-15 László Pyber , Gareth Tracey

In this short note we prove that, if $p$ is an odd prime dividing the order of a sporadic simple group, then with the exception of four groups for $p=3$, all sporadic simple groups are generated by an involution and an element of order $p$.

群论 · 数学 2015-07-08 David A. Craven

We classify integrable bounded simple weight modules over classical Lie superalgebras at infinity. We also study the categories of such modules, and we prove that for most of the classical Lie superalgebras at infinity the respective…

表示论 · 数学 2022-04-20 Lucas Calixto , Ivan Penkov

In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.

环与代数 · 数学 2009-09-25 Byunghan Kim

In this paper we introduce the concept of purely infinite rings, which in the simple case agrees with the already existing notion of pure infiniteness. We establish various permanence properties of this notion, with respect to passage to…

环与代数 · 数学 2008-06-26 Gonzalo Aranda Pino , Ken Goodearl , Francesc Perera , Mercedes Siles Molina

Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…

逻辑 · 数学 2017-05-23 Stepan Kuznetsov

In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales…

交换代数 · 数学 2009-12-01 Minh Lam Ha , Marcel Morales