Page 1 Next

Displaying 1 – 20 of 21

Showing per page

Biembeddings of symmetric configurations and 3-homogeneous Latin trades

Mike J. Grannell, Terry S. Griggs, Martin Knor (2008)

Commentationes Mathematicae Universitatis Carolinae

Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.

Binary codes and partial permutation decoding sets from the odd graphs

Washiela Fish, Roland Fray, Eric Mwambene (2014)

Open Mathematics

For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ωk, the set of all k-subsets of Ω = 1, 2, …, 2k +1, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = /0. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k)...

Binomial residues

Eduardo Cattani, Alicia Dickenstein, Bernd Sturmfels (2002)

Annales de l’institut Fourier

A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of A -hypergeometric systems of Lawrence type. The space of binomial residues of a given degree, modulo those which are polynomial in some variable, has dimension equal to the Euler characteristic of the matroid associated with A .

Bipartite graphs that are not circle graphs

André Bouchet (1999)

Annales de l'institut Fourier

The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in GF ( 2 ) .At the end of this short note I briefly recall the work of François Jaeger on circle graphs.

Biplanes.

Peter J. Cameron (1973)

Mathematische Zeitschrift

Boundary of the union of rectangles in the plane

Václav Medek (1983)

Aplikace matematiky

Given n rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.

Currently displaying 1 – 20 of 21

Page 1 Next