Related papers: Longer nilpotent series

We present assume-guarantee contracts for continuous-time linear dynamical systems with inputs and outputs. These contracts are used to express specifications on the dynamic behaviour of a system. Contrary to existing approaches, we use…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

We point out that some of the proposed generalized/modified uncertainty principles originate from solvable, or nilpotent at appropriate limits, "deformations" of Lie algebras. We briefly comment on formal aspects related to the…

We generalize Wagoner's representation of the automorphism group of a two-sided subshifts of finite type as the fundamental group of a certain CW-complex to groupoids having a certain refinement structure. This significantly streamlines the…

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. We provide a complete classification of a finite group $G$ in which every maximal $A$-invariant subgroup containing the normalizer of some $A$-invariant…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

We propose and develop a theory that allows to characterize epimorphisms of profinite groups in terms of indecomposable epimorphisms.

The maximum type-I and type-II error exponents associated with the newly introduced almost-fixed-length hypothesis testing is characterized. In this class of tests, the decision-maker declares the true hypothesis almost always after…

We give estimates for the convolution product of an arbitrary number of endlessly continuable functions. This allows us to deal with nonlinear operations for the corresponding resurgent series, e.g. substitution into a convergent power…

In this article we present an extensive survey on the developments in the theory of non-abelian finite groups with abelian automorphism groups, and pose some problems and further research directions.

The objective of this paper is to study the controllability of discrete-time linear control systems in solvable Lie groups. In the special case of nilpotent Lie groups, a necessary and sufficient condition for controllability is…

We give a detailed description of infinite locally nilpotent groups G such that the index |C_G (x) : <x>| is finite, for every non-normal cyclic subgroup <x> of G. We are also able to extend our analysis to all non-periodic groups…

Shapelet-based algorithms are widely used for time series classification because of their ease of interpretation, but they are currently outperformed by recent state-of-the-art approaches. We present a new formulation of time series…

An assortments of `species' of families of subsets of a set and some of their properties are investigated, with an eye on the logic and limit role they may play as `relaxed parallels' to ultrafilters.

These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

Several new identities for elliptic hypergeometric series are proved. Remarkably, some of these are elliptic analogues of identities for basic hypergeometric series that are balanced but not very-well-poised.

The action of the idempotent deformations on finite groups is discussed. This action is described in terms of the homological properties of groups. The orbits of finite simple groups are determined.

We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function.