• No results found

[PDF] Top 20 Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design

Has 10000 "Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design" found on our website. Below are the top 20 most common "Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design".

Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design

Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design

... a symmetric 2-(121, 16, 2) design with the automorphism group of ...of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of ... See full document

5

On the Symmetric Block Design with Parameters (306,61,12) Admitting a Group of Order 61

On the Symmetric Block Design with Parameters (306,61,12) Admitting a Group of Order 61

... An automorphism of a orbit structure is a permutation of rows followed by a per- mutation of columns leaving that matrix ...a group, which we call the automorphism group of that orbit ...a ... See full document

7

On the Symmetric Block Design with Parameters (210,77,28) Admitting a Frobenius Group of Order 57

On the Symmetric Block Design with Parameters (210,77,28) Admitting a Frobenius Group of Order 57

... of symmetric designs are known and all of them have shown to be effective in certain ...certain automorphism group acts on the design we want to construct, used by ...a symmetric ... See full document

12

ON THE SYMMETRIC BLOCK DESIGN WITH PARAMETERS (231,70,21)  ADMITTING A GROUP OF ORDER 23

ON THE SYMMETRIC BLOCK DESIGN WITH PARAMETERS (231,70,21) ADMITTING A GROUP OF ORDER 23

... Proof. By [11, Theorem 3.1] the group h ρ i fixes the same number of points and blocks. Denote that number by f. Obviously f ≡ 231(mod 23), i.e. f ≡ 1 (mod 23). The upper bound (1) for the number of fixed points ... See full document

22

Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$‎, ‎$q \leq 23$

Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$‎, ‎$q \leq 23$

... Section 2. Each subsection contains the information about the linear group that we used, subgroups of the group and it’s properties and the data about obtained ...(t- design and strongly ... See full document

22

Lie group structures on automorphism groups of real analytic CR manifolds

Lie group structures on automorphism groups of real analytic CR manifolds

... additional parameter. We will provide a deformation version of [LM07, Theorem 7.3] which allows us to treat this additional parameter in Theorem 3.2 below. (Note that it is not always possible to parametrize in a ... See full document

16

Lattice-Based  Group  Signatures   and  Zero-Knowledge  Proofs  of  Automorphism  Stability

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability

... We have implemented the group signature scheme in the C programming language. For the preimage sampling during key generation we use the Fast Fourier version [DP16] of the randomized nearest plane algorithm ... See full document

37

Topological 2 generation of automorphism groups of countable ultrahomogeneous graphs

Topological 2 generation of automorphism groups of countable ultrahomogeneous graphs

... Hence if X is finite, then ⟨ X ⟩ is either finite or countable, and if X is infinite then ⟨ X ⟩ has the same cardinality as X. Therefore, if G is uncountable and X is a generating set for G, it follows that | G | = | X | ... See full document

35

1-Designs from the group $PSL_{2}(59)$ and their automorphism groups

1-Designs from the group $PSL_{2}(59)$ and their automorphism groups

... cosets of a maximal subgroup. The word ‘Length’ denotes the length of the orbit of the stabilizer of a point and an entry m(n) determines n orbits of length m. Also, the heading ‘Aut(D)’ denotes the order of the ... See full document

12

Spectral properties of partial automorphisms of a binary rooted tree

Spectral properties of partial automorphisms of a binary rooted tree

... of symmetric group were studied by Evans in [2]; he assigned equal probabilities to the eigenvalues of a randomly chosen automorphism of a regular rooted tree, and considered the random ... See full document

10

Classification of the pentavalent symmetric graphs of order 18p

Classification of the pentavalent symmetric graphs of order 18p

... is symmetric if its automorphism group is transitive on the arc set of the ...pentavalent symmetric graphs of order 18p, for each prime ...= 2, 7 or 19, and up to isomorphism, there are ... See full document

13

The groups of automorphisms of the Lie algebras of triangular polynomial derivations

The groups of automorphisms of the Lie algebras of triangular polynomial derivations

... isomorphism classes of well-ordered Artinian sets. The ordinal number (the isomorphism class) of a well-ordered Artinian set (S, ≤) is denoted by ord(S). The class of all ordinal numbers is denoted by W. The class W is ... See full document

29

New Practical Algebraic Public Key Cryptosystem and Some Related Algebraic and Computational Aspects

New Practical Algebraic Public Key Cryptosystem and Some Related Algebraic and Computational Aspects

... The most popular present-day public-key cryptosystems are RSA and ElGamal cryptosystems. Some practical algebraic generalization of the ElGamal cryptosystem is considered-basic modular matrix cryptosystem (BMMC) over the ... See full document

7

Towards a Pólya-Carlson dichotomy for algebraic dynamics

Towards a Pólya-Carlson dichotomy for algebraic dynamics

... We cannot prove this, but will show it for a large class of automorphisms of connected finite-dimensional abelian groups (these groups are called solenoids). In addition, the arguments here do we hope make this ... See full document

21

A design investigation into the desired way of influencing people's waiting experience at a future airport

A design investigation into the desired way of influencing people's waiting experience at a future airport

... a design perspective to understand the effect on ...and design interventions are able to achieve the greatest positive ...discuss possible future ... See full document

82

Lentner, Simon
  

(2012):


	Orbifoldizing Hopf- and Nichols-Algebras.


Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

Lentner, Simon (2012): Orbifoldizing Hopf- and Nichols-Algebras. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

... cover group) of Ω begin a cen- trally extended groupring, now even as a Hopf ...of 2 -cycles necessary to dene the coalgebra structure on the orbifold, already pins down the group elements in the ... See full document

221

Symmetric subgroups in modular group algebras

Symmetric subgroups in modular group algebras

... Clearly, symmetric subgroups ...modular group algebras that possesses non-trivial symmetric sub- ...of symmetric elements forms a group, that in this case will be ...non-trivial ... See full document

5

The symmetric group and the unitary group : an application of group subgroup transformation theory

The symmetric group and the unitary group : an application of group subgroup transformation theory

... in analogy to the coupling factor and recoupling coefficient of the Racah-Wigner algebra, the symmetries and a calculational method of other transformation factors including the inductio[r] ... See full document

193

Distance Optimization and the Extremal Variety of the Grassmann Variety

Distance Optimization and the Extremal Variety of the Grassmann Variety

... The above results imply that when the eigenvalues of a skew-symmetric matrix are all equal, then its corresponding 2-vector is an element of a set whose distance from the Grassmann variety is maximum. ... See full document

17

4779.pdf

4779.pdf

... Since H is abelian, W acts on H by conjugation in a natural way. Via the adjoint representation of G on g, the action of W on H extends to an action on h. Choose any nondegenerate W -invariant symmetric form h, i ... See full document

346

Show all 10000 documents...

Related subjects