Related papers: Inverse problems in quantum graphs and accidental …

We review combinatorial quantum gravity, an approach which combines Einstein's idea of dynamical geometry with Wheeler's "it from bit" hypothesis in a model of dynamical graphs governed by the coarse Ollivier-Ricci curvature. This drives a…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

The proposed theory of causally structured discrete fields studies integer values on directed edges of a self-similar graph with a propagation rule, which we define as a set of valid combinations of integer values and edge directions around…

The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…

We consider an inverse problem in information diffusion modeled by random walks on combinatorial graphs. The problem concerns reconstruction of vertex centrality from the distribution of the first passage times observed on a subset of…

The paper studies inverse problems of determining unknown coefficients in various semi-linear and quasi-linear wave equations. We introduce a method to solve inverse problems for non-linear equations using interaction of three waves, that…

The Int_reg-problem of a combinatorial problem P asks, given a nondeterministic automaton M as input, whether the language L(M) accepted by M contains any positive instance of the problem P. We consider the Int_reg-problem for a number of…

The spectral curve is the key ingredient in the modern theory of classical integrable systems. We develop a construction of the ``quantum spectral curve'' and argue that it takes the analogous structural and unifying role on the quantum…

Motivated by the need for a more comprehensive algebraic structure to calculate coincidence probabilities of a general decay scheme for gamma ray spectroscopy, we model the decay scheme, rather naturally, as a quiver through which we define…

We introduce the concept of hypergraphs to describe quantum optical experiments with probabilistic multi-photon sources. Every hyperedge represents a correlated photon source, and every vertex stands for an optical output path. Such general…

We consider a 2-complex in a particular form, called the Quinn model of a 2-complex. It can be sliced in graphs, where a change from one graph to another can be organized by a sequence of local transitions, which are described in a list of…

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…

Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

Edges of bands of continuous spectrum of periodic structures arise as maxima and minima of the dispersion relation of their Floquet--Bloch transform. It is often assumed that the extrema generating the band edges are non-degenerate. This…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…