In this paper, it is shown that an n-variable rotation symmetric Boolean function f with n even but not a power of 2 admits a rotation symmetric function g of degree at most e ≤ n/3 such that the product gf has degree at most n− e− 1.

In this paper, we study finite-time convergence of gossip algorithms. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists a globally finite-time convergent gossip algorithm despite the number of nodes if asymmetric gossiping is allowed. For n = 2 nodes, we prove that a fastes...

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on a single matrix that are invariants by the action of conjugation by general linear group. We generalize this result showing that the abelianization of the algebra of the symmetric tensors of fixed order over a free associative algebra i...

0.1. Version . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 0.2. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 0.3. Basic conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 0.4. Tensor products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 0.5. Tensor powers of k-modules . . . . . . . . . . . ...

Let R be a Noetherian ring, F := Rr and M ⊆ F a submodule of rank r. Let A∗(M) denote the stable value of Ass(Fn/Mn), for n large, where Fn is the nth symmetric power of Fn and Mn is the image of the nth symmetric power of M in Fn. We provide a number of characterizations for a prime ideal to belong to A∗(M). We also show that A∗(M) ⊆ A∗(M), where A∗(M) denotes the stable value of Ass(Fn/Mn).

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the symmetric topology, or a directed graph referred to as the asymmetric topology. The Min-Power Symmetric (resp., Asymmetric) k-Node Connectivity problem seeks a range assignment of minimum total power su...

in future high-speed self-routing photonic networks based on all-optical time division multiplexing (otdm) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. in this paper we propose a self-routing otdm node structure composed of an all-optical router and demultiplex...

The problem of base changes for the classical symmetric functions has been solved a long time ago and has been incorporated into most computer software packages for symmetric functions. In this paper, we develop a simple recursive formula for the expansion of the augmented monomial symmetric functions into power sum symmetric functions. As corollaries, we present two algorithms that can be used...