Results 31 to 40 of about 12,641,387 (374)
Series with Commuting Terms in Topologized Semigroups
We show that the following general version of the Riemann–Dirichlet theorem is true: if every rearrangement of a series with pairwise commuting terms in a Hausdorff topologized semigroup converges, then its sum range is a singleton.
Alberto Castejón+2 more
doaj +1 more source
Generation modulo the action of a permutation group [PDF]
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism.
Nicolas Borie
doaj +1 more source
Cutoff for conjugacy-invariant random walks on the permutation group [PDF]
We prove a conjecture raised by the work of Diaconis and Shahshahani (Z Wahrscheinlichkeitstheorie Verwandte Geb 57(2):159–179, 1981) about the mixing time of random walks on the permutation group induced by a given conjugacy class. To do this we exploit
N. Berestycki, Batı Şengül
semanticscholar +1 more source
On the diameter of permutation groups [PDF]
For a set S of generators of the finite group G, let diam(G, S) denote the maximum over g ∈ G of the minimal word length expressing g in terms of S ∪ S−1. We define the diameter of G as diam(G) = maxs diam(G, S) (‘worst case’ generators). For permutation groups G of degree n, we prove that diam(G) ≤ exp((n ln n)½(1 + o(1))).
László Babai+3 more
openaire +1 more source
Primitive permutation IBIS groups [PDF]
Let $G$ be a finite permutation group on $ $. An ordered sequence of elements of $ $, $( _1,\dots, _t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{( _1,\dots, _t)}$ is trivial and no point is fixed by the stabilizer of its predecessors. If all irredundant bases of $G$ have the same size we say that $G$ is an IBIS group.
Lucchini A., Morigi M., Moscatiello M.
openaire +5 more sources
Non-Nudgable Subgroups of Permutations [PDF]
Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable,
Netzer, Tim
core +2 more sources
Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State
In this paper, our concern is to design some criteria for deterministic remote state preparation for preparing an arbitrary three-particle state via a genuinely entangled six-qubit state.
Gang Xu+5 more
doaj +1 more source
ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES [PDF]
A permutation with no fixed points is called a derangement. The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.
Modjtaba Ghorbani, Mina Rajabi-Parsa
doaj +1 more source
Trivial source bimodule rings for blocks and p-permutation equivalences [PDF]
We associate with any p-block of a finite group a Grothendieck ring of certain p-permutation bimodules. We extend the notion of p-permutation equivalences introduced by Boltje and Xu [4] to source algebras of p-blocks of finite groups.
Linckelmann, M.
core +1 more source
3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs
The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block ...
Xiaolian Liao, Guohua Chen, Shangzhao Li
doaj +1 more source