Schur -functions and spin characters of symmetric groups. I.
Schur-convexity of the complete elementary symmetric function.
Schur's determinants and partition theorems.
Score lists in bipartite multi hypertournaments
Score lists of oriented tripartite graphs.
Secant tree calculus
A true Tree Calculus is being developed to make a joint study of the two statistics “eoc” (end of minimal chain) and “pom” (parent of maximum leaf) on the set of secant trees. Their joint distribution restricted to the set {eoc-pom ≤ 1} is shown to satisfy two partial difference equation systems, to be symmetric and to be expressed in the form of an explicit three-variable generating function.
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.
Secure domination and secure total domination in graphs
A secure (total) dominating set of a graph G = (V,E) is a (total) dominating set X ⊆ V with the property that for each u ∈ V-X, there exists x ∈ X adjacent to u such that is (total) dominating. The smallest cardinality of a secure (total) dominating set is the secure (total) domination number . We characterize graphs with equal total and secure total domination numbers. We show that if G has minimum degree at least two, then . We also show that is at most twice the clique covering number of...
Secure sets and their expansion in cubic graphs
Consider a graph whose vertices play the role of members of the opposing groups. The edge between two vertices means that these vertices may defend or attack each other. At one time, any attacker may attack only one vertex. Similarly, any defender fights for itself or helps exactly one of its neighbours. If we have a set of defenders that can repel any attack, then we say that the set is secure. Moreover, it is strong if it is also prepared for a raid of one additional foe who can strike anywhere....
Segments of score sequences.
Seidel-Equivalence in LB3 (6) Graphs.
Selberg's trace formula on the -regular tree and applications.
Selected Topics from the Theory of Graph Energy: Hypoenergetic Graph
Selected topics of matroid theory and its applications
Selections and weak orderability
We answer a question of van Mill and Wattel by showing that there is a separable locally compact space which admits a continuous weak selection but is not weakly orderable. Furthermore, we show that a separable space which admits a continuous weak selection can be covered by two weakly orderable spaces. Finally, we give a partial answer to a question of Gutev and Nogura by showing that a separable space which admits a continuous weak selection admits a continuous selection for all finite sets.
Self-avoiding walks on the lattice ℤ² with the 8-neighbourhood system
This paper deals with the properties of self-avoiding walks defined on the lattice with the 8-neighbourhood system. We compute the number of walks, bridges and mean-square displacement for N=1 through 13 (N is the number of steps of the self-avoiding walk). We also estimate the connective constant and critical exponents, and study finite memory and generating functions. We show applications of this kind of walk. In addition, we compute upper bounds for the number of walks and the connective constant....
Self-complementary hypergraphs
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, called self-complementing, such that for every k-subset e of V, e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with . In the present paper, for every k, (1 ≤ k ≤ n), we give a characterization of self-complementig permutations of k-uniform self-complementary hypergraphs of the order n. This characterization implies the well known results for self-complementing permutations of graphs,...
Self-complementary vertex-transitive undirected graphs
Self-conjugate vector partitions and the parity of the spt-function
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. Recently, we found new combinatorial interpretations of congruences for the spt-function modulo 5 and 7. These interpretations were in terms of a restricted set of weighted vector partitions which we call S-partitions. We prove that the number of self-conjugate S-partitions, counted with a certain weight, is related to the coefficients of a certain mock theta function studied by the first author,...