Scaling limit of isoradial dimer models and the case of triangular quadri-tilings
Secret sharing schemes for ports of matroids of rank 3
A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid. Namely, the minimal authorized subsets of an ideal secret sharing scheme are in correspondence with the circuits of a matroid containing a fixed point. In this case, we say that the access structure is a matroid port. It is known that, for an access structure, being a matroid port is not...
Sections of simplices.
Seidel-Equivalence in LB3 (6) Graphs.
Selected topics of matroid theory and its applications
Self-orthogonal cyclic n-quasigroups.
Self-orthogonal cyclic n-quasigroups. (Short Communication).
Self-Orthogonal Steiner Systems and Projective Planes.
Semimatroids and their Tutte polynomials.
Sequenceable groups and related topics.
Seriation with applications in philology
Sets in the plane with many concyclic subsets.
Shape tiling.
Signatura of magic and Latin integer squares: isentropic clans and indexing
The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin squares are included, including the order eight Franklin subset which is of direct relevance...
Simple Groups and Möbius Planes of Even Order.
Simple minimum coverings of Kn with copies of K4 - e.
Simple quasidoubles of projective planes.
Simplicial convex 4-polytopes do not have the isotopy property
Simulated factorizations II.
Six little squares and how their numbers grow.