Extension of line-splitting operation from graphs to binary matroids.
Extension of Partial Diagonals of Matrices I.
Extension of Partial Diagonals of Matrices II.
Extension Spaces of Oriented Matroids.
Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs.
Extremely primitive groups and linear spaces
A non-regular primitive permutation group is called extremely primitive if a point stabilizer acts primitively on each of its nontrivial orbits. Let be a nontrivial finite regular linear space and Suppose that is extremely primitive on points and let rank be the rank of on points. We prove that rank with few exceptions. Moreover, we show that is neither a sporadic group nor an alternating group, and with a Fermat prime if is a finite classical simple group.
Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}.
En dos artículos, publicados en 1989, Balas y Ng dan una metodología para construir facetas del politopo de recubrimiento con coeficientes en {0, 1, 2}. Siguiendo esta metodología, en el presente artículo decimos cómo se contruyen facetas de dicho politopo con coeficientes en {0, 1, 2, 3}.
Facteurs et plans. II : plans quasi-complets
Factoring Hadamard difference sets.
Factoring an odd abelian group by lacunary cyclic subsets
It is a known result that if a finite abelian group of odd order is a direct product of lacunary cyclic subsets, then at least one of the factors must be a subgroup. The paper gives an elementary proof that does not rely on characters.
Factorisations explicites de g(y) - h(z)
Factorization results with combinatorial proofs.
Factorization theorems for strong maps between matroids of arbitrary cardinality
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
Factorizations and Paige's theorem on complete maps.
Faithful enclosing of triple systems: Doubling the index.
Figures magiques et méthode des polyèdres.
Filling a box with translates of two bricks.
Finite abelian groups and factorization problems
Finite abelian groups and factorization problems. II
Finite C3 Geometries in Which All Lines Are Thin.