Related papers: Generalized vector space partitions

A Gauss paragraph is a combinatorial formulation of a generic closed curve with multiple components on some surface. A virtual string is a collection of circles with arrows that represent the crossings of such a curve. Every closed curve…

Let $K$ be a convex subset of the state space of a finite dimensional $C^*$-algebra. We study the properties of channels on $K$, which are defined as affine maps from $K$ into the state space of another algebra, extending to completely…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

A Gross space is a vector space E of infinite dimension over some field F, which is endowed with a symmetric bilinear form Phi:E^2 -> F and has the property that every infinite dimensional subspace U subseteq E satisfies dim U^perp < dim E.…

Given a quadratic two-parameter matrix polynomial Q, we develop a systematic approach to generating a vector space of linear two-parameter matrix polynomials. We identify a set of linearizations of Q that lie in the vector space. Finally,…

Starting from arbitrary Hilbert spaces, we reduce the problem to verify entanglement of any bipartite quantum state to finite dimensional subspaces. Hence, entanglement is a finite dimensional property. A generalization for multipartite…

An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$…

Motivated by the theory of locally definable groups, we study the theory of $K$-vector spaces with a predicate for the union $X$ of an infinite family of independent subspaces. We show that if $K$ is infinite then the theory is complete and…

Quantum physical resources are directional quantities that can be formalized by unit vectors or the associated orthogonal projection operators. When compared to classical computational states which are elements of (power) sets vector…

Any Hilbert space with composite dimension can be factorized into a tensor product of smaller Hilbert spaces. This allows to decompose a quantum system into subsystems. We propose a simple tractable model for a constructive study of…

The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…

In this paper, we generalize an elementary real-analysis result to a class of topological vector spaces. We also give an example of a topological vector space to which the result cannot be generalized.

A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…

I discuss possible definitions of categories of vector spaces enriched with a notion of formal infinite linear combination in the likes of the formal infinite linear combinations one has in the context of generalized power series, I call…

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

We describe all the localization observables of a quantum particle in a one-dimensional box in terms of sequences of unit vectors in a Hilbert space. An alternative representation in terms of positive semidefinite complex matrices is…

We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.

The Generalized Parton Distributions (GPDs) are the appropriate framework for a universal description of the partonic structure of the nucleon. They characterize the dynamics of quarks and gluons inside the nucleon and consequently contain…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…