A hypergraph is said to be oriented if each edge-vertex incidence has a label of +1 or −1. An called balanced there exists bipartition the vertex set such that every edge intersects one part in positively incident vertices with and other negatively edge. In this paper, we investigate balance hypergraphs induced signed by means eigenvalues associated matrices tensors provide spectral method char...

A bstract We consider the ground state of a theory composed by M species massless complex bosons in one dimension coupled together via conformal interface. compute both Rényi entropy and negativity generic partition wires, generalizing approach developed recent work for free fermions. These entanglement measures show logarithmic growth with system size, universal prefactor depends on details in...

We use a noisy signal with finite correlation time to drive spin (dissipative impurity) in the quantum XY chain and calculate dynamics of entanglement entropy bipartition spins, for stochastic trajectory. compute noise averaged spins observe that its speed spreading decreases at strong dissipation, as result Zeno effect. recover crossover show can be used proxy heating regimes. Upon increasing ...

: Circuit partitioning is the more critical step in the physical design of various circuit in VLSI. In this partitioning main objective is to minimize the number of cuts. For this PSO algorithm is proposed for the optimization of VLSI inter connection (net list) bipartition. Meanwhile, the corresponding evaluation function and the operators of crossover and mutation are designed. The algorithm ...

In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX(d) and CX′(d) when X ′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges ...

It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...

Expanders are classes of highly connected graphs that are of fundamental importance in graph theory, with numerous applications, especially in theoretical computer science [29]. While the literature contains various definitions of expanders, this paper focuses on bipartite expanders. For ∈ (0, 1], a bipartite graph G with bipartition V (G) = A ∪ B is a bipartite -expander if |A| = |B| and |N(S)...