English
Related papers

Related papers: Verifying $k$-Contraction without Computing $k$-Co…

200 papers

Let $A$ be a $m\times m$ complex matrix with zero trace and let $\e>0$. Then there are $m\times m$ matrices $B$ and $C$ such that $A=[B,C]$ and $\|B\|\|C\|\le K_\e m^\e\|A\|$ where $K_\e$ depends only on $\e$. Moreover, the matrix $B$ can…

Functional Analysis · Mathematics 2014-03-05 William B. Johnson , Narutaka Ozawa , Gideon Schechtman

By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for…

Quantum Physics · Physics 2012-04-19 S. M. Hashemi rafsanjani , S. Agarwal

We prove a new convergence condition for the activity expansion of correlation functions in equilibrium statistical mechanics with possibly negative pair potentials. For non-negative pair potentials, the criterion is an if and only if…

Mathematical Physics · Physics 2022-10-11 Sabine Jansen , Leonid Kolesnikov

A relation consisting of tuples annotated by an element of a monoid K is called a K-relation. A K-database is a collection of K-relations. In this paper, we study entailment of inclusion dependencies over K-databases, where K is a positive…

Databases · Computer Science 2026-02-23 Miika Hannula , Teymur Ismikhanov , Jonni Virtema

The stable mod 2 cohomologies of the spectra for connective real and complex K-theories are well known and easy to work with. However, the known bases are in terms of the anti-automorphism of Milnor basis elements. We offer simple bases in…

K-Theory and Homology · Mathematics 2024-04-19 Donald M. Davis , W. Stephen Wilson

This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…

Numerical Analysis · Mathematics 2025-09-29 Daizhan Cheng

Let $k$ be a field of arbitrary characteristic, $A$ be a domain and $K=\mathrm{frac}(A)$. Then (1) All exponential maps of $k^{[3]}$ are rigid, and we give a necessary and sufficient condition for the triangularity of $\delta \in…

Commutative Algebra · Mathematics 2024-12-18 P. M. S. Sai Krishna

H-holomorphic maps are a parameter version of J-holomorphic maps into contact manifolds. They have arisen in efforts to prove the existence of higher--genus holomorphic open book decompositions and efforts to prove the existence of finite…

Symplectic Geometry · Mathematics 2009-07-23 Jens von Bergmann

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…

Computational Complexity · Computer Science 2021-07-02 Radu Curticapean , Holger Dell , Thore Husfeldt

The notions of $k$-separability and $k$-producibility are useful and expressive tools for the characterization of entanglement in multipartite quantum systems, when a more detailed analysis would be infeasible or simply needless. In this…

Quantum Physics · Physics 2021-03-05 Szilárd Szalay

In this paper, we formulate and prove a general compactness theorem for harmonic maps using Deligne-Mumford moduli space and families of curves. The main theorem shows that given a sequence of harmonic maps over a sequence of complex…

Differential Geometry · Mathematics 2024-06-07 Woongbae Park

We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…

Quantum Physics · Physics 2022-07-26 Sowrabh Sudevan , Sourin Das

Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…

Machine Learning · Computer Science 2026-03-05 Peng Xu , Chun-Ying Hou , Xiaohui Chen , Richard Y. Zhang

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent…

For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…

Algebraic Geometry · Mathematics 2021-05-04 Morihiko Saito

We prove that when Hodge theory survives on non-compact symplectic manifolds, a compact symplectic Lie group action having fixed points is necessarily Hamiltonian, provided the associated almost complex structure preserves the space of…

Symplectic Geometry · Mathematics 2015-03-17 Alvaro Pelayo , Tudor S. Ratiu

Through a redefinition of patterns in an Hopfield-like model, we introduce and develop an approach to model discrete systems made up of many, interacting components with inner degrees of freedom. Our approach clarifies the intrinsic…

Statistical Mechanics · Physics 2015-05-19 Elena Agliari , Adriano Barra

We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's…

Number Theory · Mathematics 2020-03-25 Jonathan Chapman
‹ Prev 1 3 4 5 6 7 10 Next ›