English
Related papers

Related papers: Inequalities for two systems of subspaces with pre…

200 papers

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

Combinatorics · Mathematics 2008-06-16 Aidan Roy

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

Information Theory · Computer Science 2010-11-01 Anas Chaaban , Aydin Sezgin

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…

Logic · Mathematics 2020-01-22 John Baldwin , Gianluca Paolini

We establish spherical variants of the Gleason-Kahane-Zelazko and Kowalski-S{\l}odkowski theorems, and we apply them to prove that every weak-2-local isometry between two uniform algebras is a linear map. Among the consequences, we solve a…

Functional Analysis · Mathematics 2017-05-11 Lei Li , Antonio M. Peralta , Liguang Wang , Ya-Shu Wang

Considering a communication topology of a wireless network modeled by a graph where an edge exists between two nodes if they are within each other's communication range. A subset $U$ of nodes is a dominating set if each node is either in…

Networking and Internet Architecture · Computer Science 2015-03-20 Xiaohua Xu , Xiang-Yang Li

We study long chains of iterated weak* derived sets, that is sets of all weak* limits of bounded nets, of subspaces with the additional property that the penultimate weak* derived set is a proper norm dense subspace of the dual. We extend…

Functional Analysis · Mathematics 2024-08-05 Zdeněk Silber

We consider weakly interacting massive particle (WIMP) dark matter in a Parity solution to the strong CP problem. The WIMP phenomenology can be drastically affected by the presence of Parity partners of the WIMP and electroweak gauge…

High Energy Physics - Phenomenology · Physics 2025-07-31 Matthew J. Baldwin , Keisuke Harigaya , Isaac R. Wang

Two matrix vector spaces $V,W\subset \mathbb C^{n\times n}$ are said to be equivalent if $SVR=W$ for some nonsingular $S$ and $R$. These spaces are congruent if $R=S^T$. We prove that if all matrices in $V$ and $W$ are symmetric, or all…

Representation Theory · Mathematics 2020-09-30 Genrich R. Belitskii , Vyacheslav Futorny , Mikhail Muzychuk , Vladimir V. Sergeichuk

Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

It is shown that in the weak field approximation the new geometrical approach can lead to the linear field equations for the several independent fields. For the stronger fields and in the second order approximation the field equations…

Mathematical Physics · Physics 2007-09-18 G. I. Garas'ko

The Weak Gravity Conjecture (WGC) bounds the mass of a particle by its charge. It is expected that this bound can not be below the ultraviolet cut-off scale of the effective theory. Recently, an extension of the WGC was proposed in the…

High Energy Physics - Theory · Physics 2018-04-04 Dieter Lust , Eran Palti

In this paper we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We focus on a two-stage relay-interference network where there are weak…

Information Theory · Computer Science 2010-05-05 Soheil Mohajer , Suhas N. Diggavi , Christina Fragouli , David N. C. Tse

Interconnected networks describe the dynamics of important systems in a wide range such as biological systems and electrical power grids. Some important features of these systems were successfully studied and understood through simplified…

Systems and Control · Computer Science 2016-03-18 Thanh Long Vu , Konstantin Turitsyn

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Combinatorics · Mathematics 2023-05-09 Joshua E. Ducey , Colby J. Sherwood

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

Data Structures and Algorithms · Computer Science 2009-09-11 David Eppstein

A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…

Analysis of PDEs · Mathematics 2010-09-24 Xu Liu , Xu Zhang

Recently an operator space version of type and cotype, namely type $(p,H)$ and cotype $(q,H)$ of operator spaces for $1\leq p \leq 2\leq q \leq \infty$ and a subquadratic and homogeneous Hilbetian operator space $H$ were introduced and…

Functional Analysis · Mathematics 2007-07-02 Hun Hee Lee

It is shown that for "ideal" macroscopic objects there are superselection rules forbidding superpositions of macroscopically distinguishable states of the objects. For real macroscopic bodies the notion of "weak" superselection rules is…

Quantum Physics · Physics 2007-05-23 Lev Prokhorov

In the Minimum Installation Path problem, we are given a graph $G$ with edge weights $w(.)$ and two vertices $s,t$ of $G$. We want to assign a non-negative power $p(v)$ to each vertex $v$ of $G$ so that the edges $uv$ such that $p(u)+p(v)$…

Computational Complexity · Computer Science 2020-08-20 Sergio Cabello , Éric Colin de Verdière

We establish weighted weak-type bounds for the Bergman projection with respect to Bekoll\'e-Bonami characteristics. We present two proofs of an improved quantitative weak-type $(1,1)$ estimate, as well as sharp weak-type $(p,p)$ bounds for…

Functional Analysis · Mathematics 2025-11-20 Jiale Chen , Zoe Nieraeth , Cody B. Stockdale , Nathan A. Wagner