相关论文: On reconstruction of eigenfunctions of Johnson gra…

In this work we present a survey of results on the problem of finding the minimum cardinality of the support of eigenfunctions of graphs.

We consider the symmetric group $\mathrm{Sym}_n,\,n\geqslant 2$, generated by the set $S$ of transpositions $(1~i),\,2 \leqslant i \leqslant n$, and the Cayley graph $S_n=Cay(\mathrm{Sym}_n,S)$ called the Star graph. For any positive…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

We study perfect $2$-coloring of the Johnson graphs $J(n,3)$ associated with the third largest eigenvalue and symmetric quotient matrix, which exists only when $n \in \{6, 10\}$. We survey the known constructions in the case $n=6$, give a…

We consider the problem of decomposing some $t$-uniform hypergraph $G$ into copies of another, say $H$, with nonnegative rational weights. For fixed $H$ on $k$ vertices, we show that this is always possible for all $G$ having sufficiently…

A general problem in quantum mechanics is the reconstruction of eigenstate wave functions from measured data. In the case of molecular aggregates, information about excitonic eigenstates is vitally important to understand their optical and…

Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…

We give here some precisions and improvements about the validity of the explicit reconstruction of any holomorphic function on a ball of $\mathbb{C}^2$ from its restrictions on a family of complex lines. Such validity depends on the mutual…

Mossel and Ross raised the question of when a random colouring of a graph can be reconstructed from local information, namely the colourings (with multiplicity) of balls of given radius. In this paper, we are concerned with random…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Let $n,k$ denote integers with $n>2k\geq 6$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements, and let $V$ denote a vector space over $\mathbb{F}_q$ that has dimension $n$. The projective geometry $P_q(n)$ is the partially ordered…

Attenuated Radon projections with respect to the weight function $W_\mu(x,y) = (1-x^2-y^2)^{\mu-1/2}$ are shown to be closely related to the orthogonal expansion in two variables with respect to $W_\mu$. This leads to an algorithm for…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…

We deal with a problem of the explicit reconstruction of any holomorphic function $f$ on $\mathbb{C}^2$ from its restricions on a union of complex lines. The validity of such a reconstruction essentially depends on the mutual repartition of…

The unique reconstruction of a spherically-symmetric wave speed $v$ is considered in a bounded spherical region of radius $b$ from the set of corresponding transmission eigenvalues for which the corresponding eigenfunctions are also…

Let $a, b$ and $n$ be nonnegative integers $(b \geq a, \ b > 0, \ n \geq 1)$, $\mathcal{G}_n(a,b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with at least $a$ and at most $b$ edges and \textbf{v =} $(v_1,…

We discuss reconstructing smooth real algebraic maps onto curves whose Reeb graph is as prescribed. This can be contributed to real algebraic geometry, especially in explicit examples in real algebraic geometry in a new way. The Reeb graph…

In this article, we study the eigenvalues and eigenfunction problems for the Laplace operator on multivalued functions, defined on the complement of the 2n points on the round sphere. These eigenvalues and eigensections could also be viewed…