English
Related papers

Related papers: Concurrence of Lorentz-positive maps

200 papers

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Commutative Algebra · Mathematics 2016-08-22 Boris Bukh

The space of matrices of positive determinant GL^+_n inherits an extrinsic metric space structure from R^{n^2}. On the other hand, taking the infimum of the lengths of all paths connecting two points in GL^+_n gives an intrinsic metric. We…

Algebraic Geometry · Mathematics 2017-02-28 Karin U. Katz , Mikhail G. Katz , Dmitry Kerner , Yevgeny Liokumovich

It is well known that a Lorenz curve, derived from the distribution function of a random variable, can itself be viewed as a probability distribution function of a new random variable (Arnold, 2015). We prove the surprising result that a…

Probability · Mathematics 2025-11-11 Zvetan Ignatov , Vilimir Yordanov

For all $1\leq m\leq n-1$, we investigate the interaction of locally finite measures in $\mathbb{R}^n$ with the family of $m$-dimensional Lipschitz graphs. For instance, we characterize Radon measures $\mu$, which are carried by Lipschitz…

Classical Analysis and ODEs · Mathematics 2021-03-03 Matthew Badger , Lisa Naples

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Combinatorics · Mathematics 2009-02-10 László Lovász , Balázs Szegedy

Many quantities that characterize network elements are defined in an explicit form and calculated directly from the network structure; examples of include several centrality measures like degree, closeness, or betweenness. However, there…

Physics and Society · Physics 2026-01-08 János Török , Takashi Shimada , Fumiko Ogushi , Kata Tunyogi , János Kertész , Kimmo Kaski

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Probability · Mathematics 2018-12-27 Tomasz Luczak , Abram Magner , Wojciech Szpankowski

We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…

Probability · Mathematics 2025-03-27 David Pechersky

Our goal is to study statistical properies of "dielectric resonances" which are poles of conductance of a large random $LC$ network. Such poles are a particular example of eigenvalues $\lambda_n$ of matrix pencils ${\bf H}-\lambda {\bf W}$,…

Condensed Matter · Physics 2009-10-31 Yan V. Fyodorov

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

Classical Analysis and ODEs · Mathematics 2016-11-30 Zhong Guan , Tao Wang

Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and…

Optimization and Control · Mathematics 2017-10-03 Sándor Bozóki , János Fülöp

A measurable map between measure spaces is shown to have bounded compression if and only if its image via the measure-algebra functor is Lipschitz-continuous w.r.t. the measure-algebra distances. This provides a natural interpretation of…

Metric Geometry · Mathematics 2024-03-28 Lorenzo Dello Schiavo

Parametric entities appear in many contexts, be it in optimisation, control, modelling of random quantities, or uncertainty quantification. These are all fields where reduced order models (ROMs) have a place to alleviate the computational…

Numerical Analysis · Mathematics 2019-11-25 Hermann G. Matthies , Roger Ohayon

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

Combinatorics · Mathematics 2026-02-17 Nair Abreu , Domingos M. Cardoso , Francisca A. M. França , Cybele T. M. Vinagre

Let $\Gamma$ be a closed subset of a complete Riemannian manifold $M$ of dimension $\geq 2$, let $f: M \to N$ be a Lipschitz map to a complete Riemannian manifold $N$, and let $\psi$ be a continuous function which dominates the local…

Differential Geometry · Mathematics 2024-03-13 Aidan Backus , Ng Ze-An

Using pure entangled Schmidt states, we show that m-positivity of a map is bounded by the ranks of its negative Kraus matrices. We also give an algebraic condition for a map to be m-positive. We interpret these results in the context of…

Quantum Physics · Physics 2007-05-23 Aik-meng Kuah , E. C. G. Sudarshan

In this paper we investigate the (Kohn-Sham) density-to-potential map in the case of spinless fermions in one spatial dimension, whose existence has been rigorously established by the first author in [arXiv:2504.05501 (2025)]. Here, we…

Mathematical Physics · Physics 2025-12-05 Thiago Carvalho Corso , Andre Laestadius

We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…

Classical Analysis and ODEs · Mathematics 2007-09-24 Fatma Tasdelen , Ali Olgun , Gulen Bascanbaz-Tunca

Eigenvalue-preserving-but-not-completely-eigenvalue-preserving (EnCE) maps were previously introduced for the purpose of detection and quantification of nonclassical correlation, employing the paradigm where nonvanishing quantum discord…

Quantum Physics · Physics 2012-08-09 Akira SaiToh , Robabeh Rahimi , Mikio Nakahara

We are given a bipartite graph $G = (A \cup B, E)$ where each vertex has a preference list ranking its neighbors: in particular, every $a \in A$ ranks its neighbors in a strict order of preference, whereas the preference lists of $b \in B$…

Discrete Mathematics · Computer Science 2016-03-24 Ágnes Cseh , Chien-Chung Huang , Telikepalli Kavitha