Tableaux de Young gauches
Tableaux in the Whitney module of a matroid.
Tactical decompositions of designs.
Teilmengengraphen und projektive Räume.
Ternary constant weight codes.
Ternary linear codes and quadrics.
Tesselations of multidimensional parallelepipeds.
Tessellations Generated by Hyperplanes.
Tessellations of random maps of arbitrary genus
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing one to encode such structures by labeled maps with a fixed number of faces. We investigate the scaling limits of the latter. Applications include asymptotic enumeration results for quadrangulations, and typical metric properties of randomly sampled quadrangulations. In particular, we show that scaling limits of these...
Tetrahedra on deformed spheres and integral group cohomology.
The (16,6,2) designs.
The isogonal sponges on the cubic lattice.
The active bijection between regions and simplices in supersolvable arrangements of hyperplanes.
The algebraic multiplicity of the number zero in the spectrum of a bipartite graph
The Bruhat rank of a binary symmetric staircase pattern
In this work we show that the Bruhat rank of a symmetric (0,1)-matrix of order n with a staircase pattern, total support, and containing In, is at most 2. Several other related questions are also discussed. Some illustrative examples are presented.
The calculation of α-sets of representatives
The centre of a Steiner loop and the maxi-Pasch problem
A binary operation “” which satisfies the identities , , and is called a Steiner loop. This paper revisits the proof of the necessary and sufficient conditions for the existence of a Steiner loop of order with centre of order and discusses the connection of this problem to the question of the maximum number of Pasch configurations which can occur in a Steiner triple system (STS) of a given order. An STS which attains this maximum for a given order is said to be maxi-Pasch. We show that...
The check positions of Hamming codes and the construction of a 2EC-AUED code.
The chromatic index of cyclic Steiner 2-designs.
The code problem for directed figures
We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.