Brouwer, A.E. (Andries Evert)
Brouwer, A. E.
Brouwer, Andries Evert.
Brouwer, Andries Evert, 1951-....
Andries Brouwer Nederlands wiskundige
Brouwer, Andries E. 1951-
Brouwer, Andries E.
VIAF ID: 92788469 ( Personal )
Permalink: http://viaf.org/viaf/92788469
Preferred Forms
- 100 0 _ ‡a Andries Brouwer ‡c Nederlands wiskundige
- 200 _ | ‡a Brouwer ‡b Andries Evert
-
-
- 100 1 0 ‡a Brouwer, A. E. ‡q (Andries Evert)
-
- 100 1 _ ‡a Brouwer, A. E. ‡q (Andries Evert)
-
-
-
- 100 1 _ ‡a Brouwer, Andries E.
- 100 1 _ ‡a Brouwer, Andries E. ‡d 1951-
-
- 100 1 _ ‡a Brouwer, Andries Evert ‡d 1951-
- 100 1 _ ‡a Brouwer, Andries Evert, ‡d 1951-....
-
4xx's: Alternate Name Forms (17)
5xx's: Related Names (5)
- 551 _ _ ‡a Eindhoven ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 510 2 _ ‡a Stichting Mathematisch Centrum (Amsterdam)
- 510 2 _ ‡a Technische Hogeschool Eindhoven
- 510 2 _ ‡a Technische Hogeschool Eindhoven ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Vrije Universiteit, Amsterdam
Works
Title | Sources |
---|---|
A(17,6,4) = 20 or the nonexistence of the scarce design SD(4,1;17,21) | |
Algorithms for finite-dimensional lie algebras | |
Association schemes | |
Computation of some parameters of Lie geometries | |
Contractibility and NP-completeness | |
Cursus cryptografie | |
Distance-regular graphs | |
Eigenvalues and perfect matchings | |
The enumeration of locally transitive tournaments | |
firm relocation decision | |
Graphs with balanced star-hypergraph | |
A group-divisible design GD(4,1,2;n) exists iff $n equiv 2$ (mod 6), $n not 8$ (or: the packing of cocktail party graphs with $K_4$'s). | |
An inequality in binary vector spaces | |
An infinite series of symmetric designs | |
The integral trees with spectral radius 3 | |
The linear spaces on 15 points | |
Local recognition of Tits geometries of classical type | |
Locally 4-by-4 grid graphs | |
A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo | |
A lower bound for the length of partial transversals in a Latin square | |
Near polygons with lines of size three and fischer spaces | |
A new 5-design | |
The nonexistence of a regular near hexagon on 1408 points | |
The number of mutually orthogonal Latin squares, a table up to order 10000 | |
On dual pairs of antichains | |
On the edge-colouring property for the hereditary closure of a complete uniform hypergraph | |
On the existence of 30 mutually ... 1980 | |
On the nonexistence of certain planar spaces | |
On the packing of quadruples without common triples | |
On the period of an operator | |
On the size of a maximum transversal in a Steiner triple system | |
On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the mathieu group M12) | |
Optimal packings of K4's into a Kn : the case n not equal 2 (mod 3) | |
PDP8-programming 1 : the KV8/I storage scope and H306 joystick | |
The Poincaré series of the polynomials invariant under SU/2 in its irreducible representation of degree [equals or is greater than]17 | |
Polarities of G. Higman's symmetric design and a strongly regular graph on 176 vertices | |
Regular near polygons do contain hexes | |
Some lotto numbers from an extension of Turán's theorem | |
Some unitals of 28 points and their embeddings in projective planes of order 9 | |
Spanning point-line geometries in buildings of spherical type | |
Spectra of graphs | |
Steiner triple systems without forbidden subconfigurations | |
Strongly regular graphs where mu equals two and lambda is large | |
The structure of near polygons with quads | |
Treelike spaces and related connected topological spaces | |
The triply shortened binary hamming code is optimal | |
Two infinite sequences of near polygons | |
Two number theoretic sums | |
Two optimal constant weight codes | |
Uniqueness and nonexistence of some graphs related to M22 | |
The uniqueness of the strongly regular graph on 77 points |