Displaying 81 – 100 of 127

Showing per page

On the height of order ideals

Gábor Czédli, Miklós Maróti (2010)

Mathematica Bohemica

We maximize the total height of order ideals in direct products of finitely many finite chains. We also consider several order ideals simultaneously. As a corollary, a shifting property of some integer sequences, including digit sum sequences, is derived.

On the jump number of lexicographic sums of ordered sets

Hyung Chan Jung, Jeh Gwon Lee (2003)

Czechoslovak Mathematical Journal

Let Q be the lexicographic sum of finite ordered sets Q x over a finite ordered set P . For some P we can give a formula for the jump number of Q in terms of the jump numbers of Q x and P , that is, s ( Q ) = s ( P ) + x P s ( Q x ) , where s ( X ) denotes the jump number of an ordered set X . We first show that w ( P ) - 1 + x P s ( Q x ) s ( Q ) s ( P ) + x P s ( Q x ) , where w ( X ) denotes the width of an ordered set X . Consequently, if P is a Dilworth ordered set, that is, s ( P ) = w ( P ) - 1 , then the formula holds. We also show that it holds again if P is bipartite. Finally, we prove that the lexicographic sum of...

On the lattice of pronormal subgroups of dicyclic, alternating and symmetric groups

Shrawani Mitkari, Vilas Kharat (2024)

Mathematica Bohemica

In this paper, the structures of collection of pronormal subgroups of dicyclic, symmetric and alternating groups G are studied in respect of formation of lattices L ( G ) and sublattices of L ( G ) . It is proved that the collections of all pronormal subgroups of A n and S n do not form sublattices of respective L ( A n ) and L ( S n ) , whereas the collection of all pronormal subgroups LPrN ( Dic n ) of a dicyclic group is a sublattice of L ( Dic n ) . Furthermore, it is shown that L ( Dic n ) and LPrN ( Dic n ) are lower semimodular lattices.

On the number of finite algebraic structures

Erhard Aichinger, Peter Mayr, R. McKenzie (2014)

Journal of the European Mathematical Society

We prove that every clone of operations on a finite set A , if it contains a Malcev operation, is finitely related – i.e., identical with the clone of all operations respecting R for some finitary relation R over A . It follows that for a fixed finite set A , the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few...

On the powers of Voiculescu's circular element

Ferenc Oravecz (2001)

Studia Mathematica

The main result of the paper is that for a circular element c in a C*-probability space, ( c , c n * ) is an R-diagonal pair in the sense of Nica and Speicher for every n = 1,2,... The coefficients of the R-series are found to be the generalized Catalan numbers of parameter n-1.

Currently displaying 81 – 100 of 127