Related papers: Indistinguishable sceneries on the Boolean hypercu…
Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a K\"allen--Lehmann(KL) spectral representation, the reconstruction is observed to be…
We show that the holonomy invariance of a function on the tangent bundle of a manifold, together with very mild regularity conditions on the function, is equivalent to the existence of local parallelisms compatible with the function in a…
Supervised learning with a convolutional neural network is recognized as a powerful means of image restoration. However, most such methods have been designed for application to grayscale and/or color images; therefore, they have limited…
Approaches for single-view reconstruction typically rely on viewpoint annotations, silhouettes, the absence of background, multiple views of the same instance, a template shape, or symmetry. We avoid all such supervision and assumptions by…
We study the following question: Given are two $k$-colorings $\alpha$ and $\beta$ of a graph $G$ on $n$ vertices, and integer $\ell$. The question is whether $\alpha$ can be modified into $\beta$, by recoloring vertices one at a time, while…
For tensor decompositions such as HOSVD and ParaFac, the objective functions are nonconvex. This implies, theoretically, there exists a large number of local optimas: starting from different starting point, the iteratively improved solution…
In this paper, we derive curvature estimates for strongly stable hypersurfaces with constant mean curvature immersed in $\mathbb{R}^{n+1}$, which show that the locally controlled volume growth yields a globally controlled volume growth if…
In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi,…
We study the problem of the irreducibility of the Hessian variety $\mathcal{H}_f$ associated with a smooth cubic hypersurface $V(f)\subset \mathbb{P}^n$. We prove that when $n\leq5$, $\mathcal{H}_f$ is normal and irreducible if and only if…
Given a graph $G$ and two graph homomorphisms $\alpha$ and $\beta$ from $G$ to a fixed graph $H$, the problem $H$-Recoloring asks whether there is a transformation from $\alpha$ to $\beta$ that changes the image of a single vertex at each…
This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…
If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently…
We discuss explicit landscape functions for quantum graphs. By a "landscape function" $\Upsilon(x)$ we mean a function that controls the localization properties of normalized eigenfunctions $\psi(x)$ through a pointwise inequality of the…
We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…
We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is…
Super-resolution is an important but difficult problem in image/video processing. If a video sequence or some training set other than the given low-resolution image is available, this kind of extra information can greatly aid in the…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We…
We consider fractional Sobolev spaces $H^\theta(\Gamma)$, $\theta \in [0,1]$, on a 2D surface $\Gamma$. We show that functions in $H^\theta(\Gamma)$ can be decomposed into contributions with local support in a stable way. Stability of the…
We propose a simple, interpretable framework for solving a wide range of image reconstruction problems such as denoising and deconvolution. Given a corrupted input image, the model synthesizes a spatially varying linear filter which, when…