English
Related papers

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

200 papers

This paper presents an unusual view of interference wireless networks based on complex system thinking. To proceed with this analysis, a literature review of the different applications of complex systems is firstly presented to illustrate…

Information Theory · Computer Science 2013-03-13 Pedro H. J. Nardelli , Paulo Cardieri , William A. Kretzschmar , Matti Latva-aho

This paper examines various kinds of subspaces of the non-commutative spaces that are modelled on quasi-projective commutative schemes. It is shown how intersections and unions of weakly closed subspaces, closed subspaces, their weakly open…

Quantum Algebra · Mathematics 2007-05-23 S. Paul Smith

Some connections between the deviation equations and weak equivalence principle are investigated.

General Relativity and Quantum Cosmology · Physics 2007-05-23 Bozhidar Z. Iliev

It is shown that impulsive systems of nonlinear, time-varying and/or switched form that allow a stable global state weak linearization are jointly input-to-state stable (ISS) under small inputs and integral ISS (iISS). The system is said to…

Systems and Control · Electrical Eng. & Systems 2021-09-01 José L. Mancilla-Aguilar , Hernan Haimovich

We prove that a function $f:X\to Y$ from a first-countable (more generally, Preiss-Simon) space $X$ to a regular space $Y$ is weakly discontinuous (which means that every subspace $A\subset X$ contains an open dense subset $U\subset A$ such…

General Topology · Mathematics 2017-06-21 Taras Banakh , Bogdan Bokalo

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

Combinatorics · Mathematics 2020-12-16 Ben Lund , Giorgis Petridis

The MAC-BC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we…

Information Theory · Computer Science 2016-11-17 Rick Fritschek , Gerhard Wunder

We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enumerable information about orderings in much the same way…

A space X is star-Lindelof provided for every open cover U there is a finite subset A of X such that St(A,U)=X. We show that a Tychonoff star-Lindelof space can have arbitraryly big extent while the extent of a normal star-Lindelof space…

General Topology · Mathematics 2007-05-23 Mikhail Matveev

For a given graph $G=(V,E)$ and permutation $\pi:V\mapsto V$ the prism $\pi G$ of $G$ is defined as follows: $V(\pi G)=V(G)\cup V(G')$, where $G'$ is a copy of $G$, and $E(\pi G)=E(G)\cup E(G')\cup M_{\pi}$, where $M_{\pi}=\{uv': u\in V(G),…

Combinatorics · Mathematics 2017-12-21 Monika Rosicka

Each continuous weak selection for a space $X$ defines a coarser topology on $X$, called a selection topology. Spaces whose topology is determined by a collection of such selection topologies are called continuous weak selection spaces. For…

General Topology · Mathematics 2020-03-31 Valentin Gutev

A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…

Data Structures and Algorithms · Computer Science 2013-12-20 William Evans , Michael Kaufmann , William Lenhart , Giuseppe Liotta , Tamara Mchedlidze , Stephen Wismath

The main aim of this paper is to provide cosmological constraints on the Multi Scalar Field Dark Matter model (MSFDM), in which we assume the dark matter is made up of different ultra-light scalar fields. As a first approximation, we…

Cosmology and Nongalactic Astrophysics · Physics 2022-12-05 L. O. Téllez-Tovar , Tonatiuh Matos , J. Alberto Vázquez

We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…

Functional Analysis · Mathematics 2018-10-15 Masatoshi Enomoto , Yasuo Watatani

A cellular multiple-input multiple-output (MIMO) downlink system is studied in which each base station (BS) transmits to some of the users, so that each user receives its intended signal from a subset of the BSs. This scenario is referred…

Information Theory · Computer Science 2013-02-12 Saeed Kaviani , Osvaldo Simeone , Witold A Krzymień , Shlomo Shamai

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

Logic · Mathematics 2022-04-07 Erik Walsberg

Two subspaces of a vector space are here called ``nonintersecting'' if they meet only in the zero vector. The following problem arises in the design of noncoherent multiple-antenna communications systems. How many pairwise nonintersecting…

Combinatorics · Mathematics 2014-09-17 Frederique E. Oggier , N. J. A. Sloane , A. R. Calderbank , Suhas N. Diggavi

Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

In this paper induced U-equivalence spaces are introduced and discussed. Also the notion of U-equivalently open subsets of a U-equivalence space and U-equivalently open functions are studied. Finally, equivalently uniformisable topological…

General Topology · Mathematics 2015-11-10 Farshad Omidi , MohammadReza Molaei

We study the structure of representations, defined as approximations of minimal sufficient statistics that are maximal invariants to nuisance factors, for visual data subject to scaling and occlusion of line-of-sight. We derive analytical…

Computer Vision and Pattern Recognition · Computer Science 2015-04-20 Stefano Soatto , Jingming Dong , Nikolaos Karianakis
‹ Prev 1 3 4 5 6 7 10 Next ›