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

We introduce two reconstruction schemes that enable the recovery of a function in the entire Euclidean space $\mathbb{R}^n$ from local data $(u|_W, [(-\Delta)^s u]|_W)$, where $W$ is an arbitrarily small nonempty open subset of $\mathbb…

We introduce a simple, general, and convergent scheme to compute generalized eigenfunctions of self-adjoint operators with continuous spectra on rigged Hilbert spaces. Our approach does not require prior knowledge about the eigenfunctions,…

The Funk-Radon transform assigns to a function defined on the unit sphere its integrals along all great circles of the sphere. In this paper, we consider a frame decomposition of the Funk-Radon transform, which is a flexible alternative to…

In the graph shotgun assembly problem, we are given the balls of radius $r$ around each vertex of a graph and asked to reconstruct the graph. We study the shotgun assembly of the Erd\H{o}s-R\'enyi random graph $\mathcal G(n,p)$ for a wide…

Given a bounded $C^1$ domain $\Omega\subset\R^n$ and a nonempty subset $E$ of its boundary (set of tomography), we consider broken rays which start and end at points of $E$. We ask: If the integrals of a function over all such broken rays…

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…

We consider the reconstruction of the vertex weight in the discrete Gel'fand's inverse boundary spectral problem for the graph Laplacian. Given the boundary vertex weight and the edge weight of the graph, we develop reconstruction…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

In this paper the recently introduced concept of equidistant dimension $eqdim(G)$ of graph $G$ is considered. Useful property of distance-equalizer set of arbitrary graph $G$ has been established. For Johnson graphs $J_{n,2}$ and Kneser…

Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…

Let L be a Desarguesian 2-spread in the Grassmann graph $J_q(n,2)$. We prove that the collection of the 4-subspaces, which do not contain subspaces from L is a completely regular code in $J_q(n,4)$. Similarly, we construct a completely…

We consider inverse problems consisting of the reconstruction of an unknown signal $f$ from noisy measurements $y=Ff+\text{noise}$, where $Ff$ is a function on a Riemannian manifold without boundary $\mathcal M$. We consider the case when…

We study the separability of the Neumann-Rosochatius system on the n-dimensional sphere using the geometry of bi-Hamiltonian manifolds. Its well-known separation variables are recovered by means of a separability condition relating the…

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

Given a real valued function on R^n we study the problem of recovering the function from its spherical means over spheres centered on a hyperplane. An old paper of Bukhgeim and Kardakov derived an inversion formula for the odd n case with…

Based on the novel prescription for the power of a complex number, a new expression for the eigenfunction of the operator of the third component of the angular momentum is presented. These functions are normalizable, single valued and are…

We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…