Related papers: Excedance number for involutions in complex reflec…

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.

We study the algebras generated by restriction and induction operations on complex modules over dihedral groups. In the case where the orders of all dihedral groups involved are not divisible by four, we describe the relations, a basis, the…

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

In a complex community, species continuously adapt to each other. On rare occasions, the adaptation of a species can lead to the extinction of others, and even its own. "Adaptive dynamics" is the standard mathematical framework to describe…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

Tracking on the rotation group is a key component of many modern systems for estimation of the motion of rigid bodies. To address this problem, here we describe a Bayesian algorithm that relies on directional measurements for tracking on…

We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

We construct highly singular projective curves and surfaces defined by invariants of primitive complex reflection groups.

In segmentation problems, inference on change-point position and model selection are two difficult issues due to the discrete nature of change-points. In a Bayesian context, we derive exact, non-asymptotic, explicit and tractable formulae…

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

The present report extends the method of fixed point clustering (Phys.Rev. E 61,5, R4691-4693, 2000) by introducing an indirect criterion for the number of clusters. The derived probability function allows an objective distinction of…

This article is devoted to inverse problems of recovering point sources in mathematical models of heat and mass transfer. The main attention is paid to well-posedness questions of these inverse problems with pointwise overdetermination…

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

On a compact group the Haar probability measure plays the role of uniform distribution. The entropy and rate distortion theory for this uniform distribution is studied. New results and simplified proofs on convergence of convolutions on…

We determine the finite groups whose real irreducible representations have different degrees.

We define the notion of an invariant function on a cluster ensemble with respect to an action of the cluster modular group on its associated function fields. We realize many examples of previously studied functions as elements of this type…

We consider exponential ultradistribution semigroups with non--densely defined generators and give structural theorems for ultradistribution semigroups. Also structural theorems for exponential ultradistribution semigroups are given.

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…