Displaying 101 – 120 of 1463

Showing per page

On a New Approach to Williamson's Generalization of Pólya's Enumeration Theorem

Iliev, Valentin (2000)

Serdica Mathematical Journal

Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of Schur- Macdonald’s theory (S-MT) of “invariant matrices”. Given a permutation group W ≤ Sd and a one-dimensional character χ of W , the polynomial functor Fχ corresponding via S-MT to the induced monomial representation Uχ = ind|Sdv/W (χ) of Sd , is studied. It turns out that the characteristic ch(Fχ ) is the weighted inventory of some set J(χ) of W -orbits in the integer-valued hypercube...

On a probabilistic problem on finite semigroups

Attila Nagy, Csaba Tóth (2023)

Commentationes Mathematicae Universitatis Carolinae

We deal with the following problem: how does the structure of a finite semigroup S depend on the probability that two elements selected at random from S , with replacement, define the same inner right translation of S . We solve a subcase of this problem. As the main result of the paper, we show how to construct not necessarily finite medial semigroups in which the index of the kernel of the right regular representation equals two.

On a problem of walks

Charles Delorme, Marie-Claude Heydemann (1999)

Annales de l'institut Fourier

In 1995, F. Jaeger and M.-C. Heydemann began to work on a conjecture on binary operations which are related to homomorphisms of De Bruijn digraphs. For this, they have considered the class of digraphs G such that for any integer k , G has exactly n walks of length k , where n is the order of G . Recently, C. Delorme has obtained some results on the original conjecture. The aim of this paper is to recall the conjecture and to report where all the authors arrived.

Currently displaying 101 – 120 of 1463