Related papers: Computing the nearest $\Omega$-admissible descript…
Consider $A(x,D):C^{\infty}(\Omega,E) \rightarrow C^\infty(\Omega,F)$ an elliptic and canceling linear differential operator of order $\nu$ with smooth complex coefficients in $\Omega \subset \mathbb{R}^{N}$ from a finite dimension complex…
Let $\Omega$ be an open, possibly unbounded, set in Euclidean space $\R^m$ with boundary $\partial\Omega,$ let $A$ be a measurable subset of $\Omega$ with measure $|A|$, and let $\gamma \in (0,1)$. We investigate whether the solution…
We investigate optimal control of linear port-Hamiltonian systems with control constraints, in which one aims to perform a state transition with minimal energy supply. Decomposing the state space into dissipative and non-dissipative (i.e.…
In 1974, Federer proved that all area-minimizing hypersurfaces on orientable manifolds were calibrated by weakly closed differential forms. However, in this manuscript, we prove the contrary in higher codimensions: calibrated…
The damped harmonic oscillator is a workhorse for the study of dissipation in quantum mechanics. However, despite its simplicity, this system has given rise to some approximations whose validity and relation to more refined descriptions…
We study bounded domains $\Omega\subset\mathbb{C}^n$ whose Bergman metric is locally symmetric, i.e. its Riemannian curvature tensor is parallel with respect to the Levi-Civita connection. Following the strategy developed in…
The objective of this article is to apply recent developments in geometric optimal control to analyze the time minimum control problem of dissipative two-level quantum systems whose dynamics is governed by the Lindblad equation. We focus…
A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…
The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing…
It is proved that a discrete group $G$ is amenable if and only if for every unitary representation of $G$ in an infinite-dimensional Hilbert space $\cal H$ the maximal uniform compactification of the unit sphere $\s_{\cal H}$ has a…
Given a Hilbert space and the generator $A$ of a strongly continuous, exponentially stable, semigroup on this Hilbert space. For any $g(-s) \in {\mathcal H}_{\infty}$ we show that there exists an infinite-time admissible output operator…
Let $\Omega$ be a smooth, bounded domain of $\mathbb{R}^{N}$, $\omega$ be a positive, $L^{1}$-normalized function, and $0<s<1<p.$ We study the asymptotic behavior, as $p\rightarrow\infty,$ of the pair $\left( \sqrt[p]{\Lambda_{p}%…
If $E$ is a graph and $K$ is a field, we consider an ideal $I$ of the Leavitt path algebra $L_K(E)$ of $E$ over $K$. We describe the admissible pair corresponding to the smallest graded ideal which contains $I$ where the grading in question…
We consider a nearest-neighbor four state hard-core (HC) model on the homogeneous Cayley tree of order $k$. The Hamiltonian of the model is considered on a set of "admissible" configurations. Admissibility is specified through a graph with…
Given an infinite subset $\mathcal A \subseteq\mathbb N$, let $A$ denote its smallest $N$ elements. There is a rich and growing literature on the question of whether for typical $\alpha\in[0,1]$, the pair correlations of the set $\alpha A…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
A non-equilibrium open-dissipative neural network, such as a coherent Ising machine based on mutually coupled optical parametric oscillators, has been proposed and demonstrated as a novel computing machine for hard combinatorial…
The well known maximum-entropy principle due to Jaynes, which states that given mean parameters, the maximum entropy distribution matching them is in an exponential family, has been very popular in machine learning due to its "Occam's…
Min-plus product of two $n\times n$ matrices is a fundamental problem in algorithm research. It is known to be equivalent to APSP, and in general it has no truly subcubic algorithms. In this paper, we focus on the min-plus product on a…
Motivated by applications of the discrete random Schr\"odinger operator, mathematical physicists and analysts, began studying more general Anderson-type Hamiltonians; that is, the family of self-adjoint operators $$H_\omega = H + V_\omega$$…