EuDML | Browse

Displaying 81 – 90 of 90

Sur la complexité de familles d’ensembles pseudo-aléatoires

Ramachandran Balasubramanian, Cécile Dartyge, Élie Mosaki (2014)

Annales de l’institut Fourier

Dans cet article, on s’intéresse au problème suivant. Soient $p$ un nombre premier, $S \subset 𝔽_{p}$ et $𝒫 \subset {P \in 𝔽_{p} [X] : deg P \leq d}$ . Quel est le plus grand entier $k$ tel que pour toutes paires de sous-ensembles disjoints $𝒜, ℬ$ de $𝔽_{p}$ vérifiant $| 𝒜 \cup ℬ | = k$ , il existe $P \in 𝒫$ tel que $P (x) \in S$ si $x \in 𝒜$ et $P (x) \notin S$ si $x \in ℬ$ ? Ce problème correspond à l’étude de la complexité de certaines familles d’ensembles pseudo-aléatoires. Dans un premier temps, nous rappelons la définition de cette complexité et resituons le contexte des ensembles pseudo-aléatoires. Ensuite, nous exposons les différents...

Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.

Jørgensen, L.K., Klin, M. (2003)

The Electronic Journal of Combinatorics [electronic only]

Symmetric balanced ternary designs with ...1 = 1 or 2.

J.D. Fanning (1994)

Aequationes mathematicae

Symmetric balanced ternary designs with ...1 = 1 or 2. (Summary).

J.D. Fanning (1994)

Aequationes mathematicae

Symmetric bowtie decompositions of the complete graph.

Bonvicini, Simona, Ruini, Beatrice (2010)

The Electronic Journal of Combinatorics [electronic only]

Symmetric Hadamard matrices of order 116 and 172 exist

Olivia Di Matteo, Dragomir Ž. Ðoković, Ilias S. Kotsireas (2015)

Special Matrices

We construct new symmetric Hadamard matrices of orders 92, 116, and 172. While the existence of those of order 92 was known since 1978, the orders 116 and 172 are new. Our construction is based on a recent new combinatorial array (GP array) discovered by N. A. Balonin and J. Seberry. For order 116 we used an adaptation of an algorithm for parallel collision search. The adaptation pertains to the modification of some aspects of the algorithm to make it suitable to solve a 3-way matching problem....

Symmetric translation nets.

Dieter Jungnickel (1982)

Journal für die reine und angewandte Mathematik

Symmetries in Steinhaus triangles and in generalized Pascal triangles.

Brunat, Josep M., Maureso, Montserrat (2011)

Integers

Symmetries of woven fabrics

Bohdan Zelinka (1984)

Aplikace matematiky

Symmetrized and continuous generalization of transversals

Martin Kochol (1996)

Mathematica Bohemica

The theorem of Edmonds and Fulkerson states that the partial transversals of a finite family of sets form a matroid. The aim of this paper is to present a symmetrized and continuous generalization of this theorem.

Displaying 81 – 90 of 90

Currently displaying 81 – 90 of 90