Skolem-type difference sets for cycle systems.
Sliding-mode pinning control of complex networks
In this paper, a novel approach for controlling complex networks is proposed; it applies sliding-mode pinning control for a complex network to achieve trajectory tracking. This control strategy does not require the network to have the same coupling strength on all edges; and for pinned nodes, the ones with the highest degree are selected. The illustrative example is composed of a network of 50 nodes; each node dynamics is a Chen chaotic attractor. Two cases are presented. For the first case the...
Small bases for finite groups
Small directed graphs as neighbourhood graphs
Small forbidden configurations. II.
Small forbidden configurations. III.
Small group divisible Steiner quadruple systems.
Small integral trees.
Small maximal independent sets and faster exact graph coloring.
Small -dominating sets.
Small Ramsey numbers.
Smallest cubic and quartic graphs with a given number of cutpoints and bridges.
Smallest Regular Graphs of Given Degree and Diameter
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.
Smooth and sharp thresholds for random -XOR-CNF satisfiability
The aim of this paper is to study the threshold behavior for the satisfiability property of a random -XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with variables per equation. For we show the existence of a sharp threshold for the satisfiability of a random -XOR-CNF formula, whereas there are smooth thresholds for and .
Smooth and sharp thresholds for random {k}-XOR-CNF satisfiability
The aim of this paper is to study the threshold behavior for the satisfiability property of a random k-XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with k variables per equation. For k ≥ 3 we show the existence of a sharp threshold for the satisfiability of a random k-XOR-CNF formula, whereas there are smooth thresholds for k=1 and k=2.
Smooth spheres in IR4 with four critical points are standard.
Snaky is a 41-dimensional winner.
Sobre la representación de un conjunto mediante árboles aditivos.
En este trabajo se estudia el problema de la representación de un conjunto mediante árboles aditivos, en el sentido de hallar una formalización que permita abordar el mismo desde la perspectiva general de los métodos geométricos de representación del análisis multivariante.
Sobre un cono convexo asociado a un grafo.
En este artículo se construye un cono convexo sobre un grafo y se estudian las propiedades básicas de este cono convexo: dimensión, linealidad y sistemas minimales de generadores. El interés de esta situación tiene su origen en problemas de decisión, donde la información disponible está dada por órdenes parciales entre las componentes de la información. Sin embargo, el estudio realizado es independiente de los problemas de decisión que lo motivan.
Sofic groups are not locally embeddable into finite Moufang loops
We shall show that there exist sofic groups which are not locally embeddable into finite Moufang loops. These groups serve as counterexamples to a problem and two conjectures formulated in the paper by M. Vodička, P. Zlatoš (2019).