Related papers: The probability that an operator is nilpotent

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…

A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…

Jacobson proved that if a Lie algebra admits an invertible derivation, it must be nilpotent. He also suspected, though incorrectly, that the converse might be true: that every nilpotent Lie algebra has an invertible derivation. We prove…

For an arbitrary operator ideal I, every nilpotent element of I is a single commutator of operators from I^t, for an exponent t that depends on the degree of nilpotency.

Premet has conjectured that the nilpotent variety of any finite-dimensional restricted Lie algebra is an irreducible variety. In this paper, we prove this conjecture in the case of Hamiltonian Lie algebra. and show that its nilpotent…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

We generalize a preceding simple proof of the Jamiolkowski criterion to check whether a given linear map between algebras of operators is completely positive or not. The generalization is performed to embrace all algebras of Hilbert-Schmidt…

We develop the theory of the higher commutator for Taylor varieties. A new higher commutator operation called the hypercommutator is defined using a type of invariant relation called a higher dimensional congruence. The hypercommutator is…

In the present paper we prove that the probabilities of the P\'olya urn distribution (with negative replacement) satisfy a monotonicity property similar to that of the binomial distribution (P\'olya urn distribution with no replacement). As…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

In this paper we give another characterization of the strictly nilpotent elements in the Weyl algebra, which (apart from the polynomials) turn out to be all bispectral operators with polynomial coefficients. This also allows to reformulate…

Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation. We study the probability that the machine will produce a…

This is the first of a series of papers devoted to certain pairs of commuting nilpotent elements in a semisimple Lie algebra that enjoy quite remarkable properties and which are expected to play a major role in Representation theory. The…

The difficulty for solving ill-posed linear operator equations in Hilbert space is reflected by the strength of ill-posedness of the governing operator, and the inherent solution smoothness. In this study we focus on the ill-posedness of…

In this paper, we systematically investigate the nilpotentizer and nilpotent graph for a Lie superalgebra over the field of characteristic not equal to 2. First, we establish some fundamental properties of the nilpotentizer. Next, we show…

The 'degree of k-step nilpotence' of a finite group G is the proportion of the tuples (x_1,...,x_{k+1}) in G^{k+1} for which the simple commutator [x_1,...,x_{k+1}] is equal to the identity. In this paper we study versions of this for an…

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

I.M. Gelfand and V.A. Ponomarev (1969) proved that the problem of classifying pairs (A,B) of commuting nilpotent operators on a vector space contains the problem of classifying an arbitrary t-tuple of linear operators. Moreover, it contains…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

We prove the Weyl-von Neumann-Berg theorem for quaternionic right linear operators (not necessarily bounded) in a quaternionic Hilbert space: Let $N$ be a right linear normal (need not be bounded) operator in a quaternionic separable…