Related papers: Weight of quadratic forms and graph states
We combine the Duke-Imamoglu-Ikeda lifting with the theta lifting to produce new CAP representations of metaplectic, symplectic and orthogonal groups. These constructions partially generalize the theories of Waldspurger on the Shimura…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
In his paper from 1996 on quadratic forms Heath-Brown developed a version of the circle method to count points in the intersection of an unbounded quadric with a lattice of short period, if each point is given a weight, and approximated…
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…
Let B_{2t} be a bipartite planar graph with an even number of regions. We are able to find bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to the graph. We also will investigate the minimal…
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
In graph representation learning, it is important that the complex geometric structure of the input graph, e.g. hidden relations among nodes, is well captured in embedding space. However, standard Euclidean embedding spaces have a limited…
We show that Kauffman brackets of colored framed graphs (also known as quantum spin networks) can be renormalized to a Laurent polynomial with integer coefficients by multiplying it by a coefficient which is a product of quantum factorials…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forward. A simple observation illuminates that edge weighting…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie…
This work establishes a direct operational connection between the entanglement structures of specific three-qubit states (i.e. multipartite entanglement) and their corresponding topological links. We investigate the symmetric $\wwbar$ state…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…
We introduce the notions of $\mathbb{K}$-framings, based $\mathbb{K}$-framings and relative $\mathbb{K}$-framings of a compact connected oriented surface $\Sigma$ for any commutative ring $\mathbb{K}$ with unit, and a map which maps a based…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
The paper aims at proving global height estimates for Killing graphs defined over a complete manifold with nonempty boundary. To this end, we first point out how the geometric analysis on a Killing graph is naturally related to a weighted…