We consider the billiard map in the hypercube of . We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that is the order of magnitude of the complexity.
Two operators are constructed which make it possible to transform ternary relations into binary relations defined on binary relations and vice versa. A possible graphical representation of ternary relations is described.
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)...
We introduce the function , where and are the pdf and cdf of , respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in the case of small samples (where asymptotic results do not work), and in general for max-type random variables...
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 -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 .
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 .At the end of this short note I briefly recall the work of François Jaeger on circle graphs.