Related papers: Universal Bound on the Eigenvalues of 2-Positive T…
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
We provide a complete picture of contractivity of trace preserving positive maps with respect to $p$-norms. We show that for $p>1$ contractivity holds in general if and only if the map is unital. When the domain is restricted to the…
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…
Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…
Completely positive trace-preserving maps $S$, also known as quantum channels, arise in quantum physics as a description of how the density operator $\rho$ of a system changes in a given time interval, allowing not only for unitary…
Assuming the existence of a local, analytic, unitary UV completion in a Poincar\'{e} invariant scalar field theory with a mass gap, we derive an infinite number of positivity requirements using the known properties of the amplitude at and…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to the set $\{0,1,...,k\}$ of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ is a vertex and $y$ is an edge incident…
We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…
While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We consider a Gaussian random matrix with correlated entries that have a power law decay of order $d>2$ and prove universality for the extreme eigenvalues. A local law is proved using the self-consistent equation combined with a…
Let $p$ be a fixed prime number, and $q$ a power of $p$. For any curve over $\mathbb{F}_q$ and any local system on it, we have a number field generated by the traces of Frobenii at closed points, known as the trace field. We show that as we…
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2…
A general framework for determining fundamental bounds in nanophotonics is introduced in this paper. The theory is based on convex optimization of dual problems constructed from operators generated by electromagnetic integral equations. The…
We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
We study hidden boundary trace regularity for two-dimensional hyperbolic equations with boundary degeneracy governed by $\mcA\vp=-\Div(A\nabla \vp)$, where $A=\diag(1,r^\al)$ and $\al\in(0,1)$. We establish well-posedness in weighted…