A5008727965- Finite Group Theory Research
- graph theory and CDMA systems
- Coding theory and cryptography
- Geometric and Algebraic Topology
- Advanced Topics in Algebra
- Mathematics and Applications
- Advanced Algebra and Geometry
- Limits and Structures in Graph Theory
- semigroups and automata theory
- Rings, Modules, and Algebras
- Advanced Algebra and Logic
- Advanced Graph Theory Research
- Chronic Lymphocytic Leukemia Research
- Cooperative Communication and Network Coding
- Advanced Topology and Set Theory
- Algebraic structures and combinatorial models
- Advanced Differential Equations and Dynamical Systems
- Homotopy and Cohomology in Algebraic Topology
- Computability, Logic, AI Algorithms
- advanced mathematical theories
- Analytic Number Theory Research
- Cellular Automata and Applications
- Algebraic Geometry and Number Theory
- Topological and Geometric Data Analysis
- Optimal Experimental Design Methods
University of Oregon
2009-2022
Northeastern University
2013-2021
Walter de Gruyter (Germany)
2019-2020
University of Würzburg
2019-2020
Technische Universität Berlin
2019-2020
German-Israeli Cooperation
2020
Boston University
2013
University of Southern California
1973-2010
Cornell University
2010
Hebrew University of Jerusalem
2010
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1, h2) sets in PG(k − 1, q), and certain strongly regular graphs. also describe tabulate essentially all known examples.
In an orthogonal vector space of type $\Omega ^ + ( 4n,q )$, a spread is family $q^{2n - 1} 1$ totally singular $2n$-spaces which induces partition the points; these spreads are closely related to Kerdock sets. $2m$-dimensional over $GF q $q^m subspaces dimension m points underlying projective space; correspond affine translation planes. By combining geometric, group theoretic and matrix methods, new types constructed old examples studied. New sets planesare obtained having various...
We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main results are these: A1. A polynomial time algorithm to test simplicity find composition factors a given permutation (COMP). A2. elements prime order p in divisible by p. A3. reduction finding Sylow subgroups groups (SYLFIND) intersection two cosets (INT). As consequence, one can solvable with bounded nonabelian time. A4. solve SYLFIND for finite simple groups. A5. An...
The permutation representations in the title are all determined, and no surprises found to occur.
All conjugacy classes of subgroups <italic>G</italic> classical groups characteristic <italic>p</italic> are determined, which generated by a class long root elements and satisfy <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper O Subscript p Baseline left-parenthesis upper G right-parenthesis less-than-or-slanted-equals prime intersection Z right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD">...
The permutation representations in the title are all determined, and no surprises found to occur.
An ovoid in an orthogonal vector space V of type Ω + (2 n , q ) or Ω(2 – 1, is a set –1 1 pairwise non-perpendicular singular points. Ovoids probably do not exist when > 4 (cf. [ 12 ], 6 ]) and seem to be rare = 4. On the other hand, 3 they correspond affine translation planes order 2 via Klein correspondence between PG (3, (6, quadric. In this paper we will describe examples having Those with arise from (2, ), AG Ree groups. Since each example produces at least one 3, are led new .
Introduction Preliminaries Special linear groups: $\mathrm {PSL} (d,q)$ Orthogonal $\mathrm{P}\Omega^\varepsilon(d,q)$ Symplectic $\mathrm{PSp}(2m,q)$ Unitary $\mathrm{PSU}(d,q)$ Proofs of Theorems 1.1 and 1.1, corollaries 1.2-1.4 Permutation group algorithms Concluding remarks References.