Displaying 21 – 40 of 856

Showing per page

Termal groupoids

Jaroslav Ježek (2002)

Czechoslovak Mathematical Journal

We investigate the factor of the groupoid of terms through the largest congruence with a given set among its blocks. The set is supposed to be closed for overterms.

Ternary quasigroups and the modular group

Jonathan D. H. Smith (2008)

Commentationes Mathematicae Universitatis Carolinae

For a positive integer n , the usual definitions of n -quasigroups are rather complicated: either by combinatorial conditions that effectively amount to Latin n -cubes, or by 2 n identities on n + 1 different n -ary operations. In this paper, a more symmetrical approach to the specification of n -quasigroups is considered. In particular, ternary quasigroups arise from actions of the modular group.

Ternary semigroups of morphisms of objects in categories

Antoni Chronowski, Miroslav Novotný (1995)

Archivum Mathematicum

In this paper the notion of a ternary semigroup of morphisms of objects in a category is introduced. The connection between an isomorphism of categories and an isomorphism of ternary semigroups of morphisms of suitable objects in these categories is considered. Finally, the results obtained for general categories are applied to the categories 𝐑𝐄𝐋 n + 1 and 𝐀𝐋𝐆 n which were studied in [5].

Testing Cayley graph densities

Goulnara N. Arzhantseva, Victor S. Guba, Martin Lustig, Jean-Philippe Préaux (2008)

Annales mathématiques Blaise Pascal

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m -generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2 m . We test amenable and non-amenable...

Tetravalent Arc-Transitive Graphs of Order 3p 2

Mohsen Ghasemi (2014)

Discussiones Mathematicae Graph Theory

Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p2 is given

Tetravalent half-arc-transitive graphs of order p 2 q 2

Hailin Liu, Bengong Lou, Bo Ling (2019)

Czechoslovak Mathematical Journal

We classify tetravalent G -half-arc-transitive graphs Γ of order p 2 q 2 , where G 𝖠𝗎𝗍 Γ and p , q are distinct odd primes. This result involves a subclass of tetravalent half-arc-transitive graphs of cube-free order.

The 3-modular characters of the twisted Chevalley group 2D4(2) y 2D4(2).2.

Ibrahim A. I. Suleiman (1995)

Revista Matemática de la Universidad Complutense de Madrid

In this paper we calculate the 3-modular character table of the twisted Chevalley group 2D4(2) and its automorphism group 2D4(2).2. The Meat-Axe package for calculating modular characters over finite fields (Ryba (1990)) was used to calculate most of the characters. The method of condensation, which was explained in Suleiman (1990) was used to determine the complete character table. All these methods are explained later in this paper.

The 4-string braid group B 4 has property RD and exponential mesoscopic rank

Sylvain Barré, Mikaël Pichot (2011)

Bulletin de la Société Mathématique de France

We prove that the braid group B 4 on 4 strings, its central quotient B 4 / z , and the automorphism group Aut ( F 2 ) of the free group F 2 on 2 generators, have the property RD of Haagerup–Jolissaint. We also prove that the braid group B 4 is a group of intermediate mesoscopic rank (of dimension 3). More precisely, we show that the above three groups have exponential mesoscopic rank, i.e., that they contain exponentially many large flat balls which are not included in flats.

Currently displaying 21 – 40 of 856