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

As wireless systems grow rapidly worldwide, one of the most important things, wireless systems designers and service providers faces is interference. Interference decreases coverage, capacity [1], and limits the effectiveness of both new…

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

It is generally believed that weak scale supersymmetry implies weak scale supergravity, in the sense that the masses of the gravitino and gravitationally coupled moduli have masses below 100 TeV. This paper presents a realistic framework…

In this paper the weak topology on a normed space is studied from the viewpoint of infinite-dimensional topology. Besides the weak topology on a normed space $X$ (coinciding with the topology of uniform convergence on finite subsets of the…

We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted…

This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…

Hyperbolic-parabolic systems have spatially homogenous stationary states. When the dissipation is weak, one can derive weakly nonlinear-dissipative approximations that govern perturbations of these constant states. These approximations are…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Consider a $k$-valued network. Two kinds of (control) invariant subspaces, called state and dual invariant subspaces, are proposed, which are subspaces of state space and dual space respectively. Algorithms are presented to verify whether a…

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

We propose a new version of the scalar Weak Gravity Conjecture (WGC) which would apply to any scalar field coupled to quantum gravity. For a single scalar it is given by the differential constraint $V''\leq…

Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show…

We define the notion of weak Minkowski metric and prove some basic properties of such metrics. We also highlight some of the important analogies between Minkowski geometry and the Funk and Hilbert geometries.

The exchange of light pseudoscalars between fermions leads to a spin-independent potential in order g^4, where g is the Yukawa pseudoscalar-fermion coupling constant. This potential gives rise to detectable violations of both the weak…

In real-world applications, observations are often constrained to a small fraction of a system. Such spatial subsampling can be caused by the inaccessibility or the sheer size of the system, and cannot be overcome by longer sampling.…

In this paper we show that set-intersection is harder than distance oracle on sparse graphs. Given a collection of total size n which consists of m sets drawn from universe U, the set-intersection problem is to build a data structure which…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…

For any Calder\'on-Zygmund operator $ T$, any weight $ w$, and $ \alpha >1$, the operator $ T$ is bounded as a map from $ L ^{1} (M _{ L \log\log L (\log\log\log L) ^{\alpha } } w )$ into weak-$L^1(w)$. The interest in questions of this…