Algebraic combinatorics. Translated from the Japanese
From MaRDI portal
Publication:2213486
Recommendations
Cited in
(64)- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- Book review of: E. Bannai et al., Algebraic combinatorics
- Book review of: H.-H. Wu, Understanding numbers in elementary school mathematics
- Combinatorial methods in algebra. Transl. from the Russian
- Tridiagonal pairs, alternating elements, and distance-regular graphs
- On polarization of spherical codes and designs
- Multipartite information of free fermions on Hamming graphs
- scientific article; zbMATH DE number 3882507 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- A propos du choix du partenaire en aïkido : éléments d'algèbre et de combinatoire des appariements d'un ensemble fini
- scientific article; zbMATH DE number 49672 (Why is no real title available?)
- Isomorphisms, symmetry and computations in algebraic graph theory. Selected papers based on the presentations at the workshop on algebraic graph theory, Pilsen, Czech Republic, October 3--7, 2016
- Packings and Steiner systems in polar spaces
- On association schemes generated by a relation or an idempotent
- Schematic 4-designs
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Superspace realizations of the Bannai-Ito algebra
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Optimal and extremal graphical designs on regular graphs associated with classical parameters
- A Q-polynomial structure associated with the projective geometry L_N (q)
- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- Distance-regular graphs with exactly one positive q-distance eigenvalue
- A bivariate \(Q\)-polynomial structure for the non-binary Johnson scheme
- Inclusion matrices for rainbow subsets
- Near-bipartite Leonard pairs
- PBIB-designs from certain subsets of distance-regular graphs
- Bivariate \(Q\)-polynomial structures for the nonbinary Johnson scheme and the association scheme obtained from attenuated spaces
- m-distance-regular graphs and their relation to multivariate P-polynomial association schemes
- On the Q-polynomial property of the full bipartite graph of a Hamming graph
- Dual bipartite \(Q\)-polynomial distance-regular graphs and dual uniform structures
- Revised schematic array
- Projective geometries, Q-polynomial structures, and quantum groups
- A q-version of the relation between the hypercube, the Krawtchouk chain and Dicke states
- Spin models and distance-regular graphs of \(q\)-Racah type
- A characterization of the Grassmann graphs
- Symmetric designs constructed by group divisible designs
- 2-homogeneous bipartite distance-regular graphs and the quantum group \(U^\prime_q(\mathfrak{so}_6)\)
- Antipodality of spherical designs with odd harmonic indices
- Polarization of lattices: stable cold spots and spherical designs
- The nucleus of the Hamming graph H(D,q)
- Verma modules and finite-dimensional irreducible modules of the universal Askey-Wilson algebra at roots of unity
- Fourier analysis on distance-regular Cayley graphs over abelian groups
- Some orbits of a two-vertex stabilizer in a Grassmann graph
- On the Q-polynomial property of bipartite graphs admitting a uniform structure
- The nucleus of the Johnson graph J(N,D)
- Semicomplete multipartite weakly distance-regular digraphs
- Ellipsoidal designs and the Prouhet-Tarry-Escott problem
- Homogeneous spaces of semidirect products and finite Gelfand pairs
- On co-edge-regular graphs with 4 distinct eigenvalues
- The nucleus of a Q-polynomial distance-regular graph
- The S₃-symmetric tridiagonal algebra
- Characterizations of amorphic schemes and fusions of pairs
- Every nonsymmetric 4-class association scheme can be generated by a digraph
- On commutative association schemes and associated (directed) graphs
- The Norton-balanced condition for Q-polynomial distance-regular graphs
- Universal minima of discrete potentials for sharp spherical codes
- Multivariate P- and/or Q-polynomial association schemes
- On set systems without singleton intersections
- The degree of functions in the Johnson and q-Johnson schemes
- An equitable partition for the distance-regular graph of the bilinear forms
- Geometric designs and Hilbert-Kamke equations of degree five for classical orthogonal polynomials
- Schematic arrays with maximum rank
- Hitting times and resistance distances in the hypercube
- Classification algorithms for codes and designs
This page was built for publication: Algebraic combinatorics. Translated from the Japanese
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2213486)
