SV40 assembly in vivo and in vitro.
Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.
Switchings, realizations, and interpolation theorems for graph parameters.
Symbol-crunching with the transfer-matrix method in order to count skinny physical creatures.
Symbolic summation assists combinatorics.
Symmetric and antisymmetric vector-valued Jack polynomials.
Symmetric balanced ternary designs with ...1 = 1 or 2.
Symmetric balanced ternary designs with ...1 = 1 or 2. (Summary).
Symmetric bowtie decompositions of the complete graph.
Symmetric embedding of finite lattices into finite partition lattices
Symmetric flows and broadcasting in hypercubes
In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an -dimensional hypercube in the circuit switched, -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...
Symmetric functions and multivariate basic hypergeometric series. (Fonctions symétriques et séries hypergéométriques basiques multivariées.)
Symmetric functions. (Fonctions symétriques.)
Symmetric functions for the generating matrix of the Yangian of .
Symmetric groups and expanders.
Symmetric Hadamard matrices of order 116 and 172 exist
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 Hamilton Cycle Decompositions of Complete Multigraphs
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition of...
Symmetric identity for polynomial sequences satisfying
Using umbral calculus, we establish a symmetric identity for any sequence of polynomials satisfying with a constant polynomial. This identity allows us to obtain in a simple way some known relations involving Apostol-Bernoulli polynomials, ApostolEuler polynomials and generalized Bernoulli polynomials attached to a primitive Dirichlet character.
Symmetric inclusion-exclusion.
Symmetric Laman theorems for the groups and .