Related papers: Generalized wordlength patterns and strength

We generalise the construction of $Q$-family of quandles and $G$-family of quandles which were introduced in the paper of A. Ishii, M. Iwakiri, Y. Jang, K. Oshiro, and find connection with other constructions of quandles. We define a…

Confidence nets, that is, collections of confidence intervals that fill out the parameter space and whose exact parameter coverage can be computed, are familiar in nonparametric statistics. Here, the distributional assumptions are based on…

In "On the asymptotics of the growth of 2-step nilpotent groups" (J. London Math. Soc. (2), 58 (1998)), we remarked that, contrary to 2-step nilpotent simply connected Lie groups, in 3-step nilpotent simply connected Lie groups it is…

We begin with (densely-defined) fractional linear transformations (FLT) on (some) Banach algebras and their relatives. This leads to Wedderburn's continued fractions (recursively-defined noncommutative polynomials) for any ring. Along the…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

We characterize the generator matrix in standard form of generalized Gabidulin codes. The parametrization we get for the non-systematic part of this matrix coincides with the $q$-analogue of generalized Cauchy matrices, leading to the…

Given an action of an affine algebraic group with only trivial characters on a factorial variety, we ask for categorical quotients. We characterize existence in the category of algebraic varieties. Moreover, allowing constructible sets as…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

Researchers have developed ways to generalize the mean and variance to situations in which a data metric is available. We apply the tools developed in Pennec (2006) to categorical data, and show the generality of this approach by…

The notion of group entropy is proposed. It enables to unify and generalize many different definitions of entropy known in the literature, as those of Boltzmann-Gibbs, Tsallis, Abe and Kaniadakis. Other new entropic functionals are…

Using a m\'elange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably…

We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…

Generalised matrix elements of the irreducible representations of the quantum $SU(2)$ group are defined using certain orthonormal bases of the representation space. The generalised matrix elements are relatively infinitesimal invariant with…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…

A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…

This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the…

We consider nonregular fractions of factorial experiments for a class of linear models. These models have a common general mean and main effects, however they may have different 2-factor interactions. Here we assume for simplicity that…

A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally…