Related papers: Partitions and Indivisibility Properties of Counta…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…
In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that, if V is a finite vector space over a field of order q, then the number of the subspaces of…
A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every…
Some new necessary conditions for the existence of vector space partitions are derived. They are applied to the problem of finding the maximum number of spaces of dimension t in a vector space partition of V(2t,q) that contains m_d spaces…
In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…
In this paper we extend our findings in [3] and answer further questions regarding continuity and discontinuity of seminorms on infinite-dimensional vector spaces.
Our main purpose here is to study some qualitative aspects of space and time. These include the notion of space and time regarded as the containers of respectively bodies and events, the divisibility of space, and the unrepeatability of…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
We investigate the possibility of dividing quantum channels into concatenations of other channels, thereby studying the semigroup structure of the set of completely-positive trace-preserving maps. We show the existence of 'indivisible'…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…
While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of a particular infinitedimensional separable quotient in some Banach spaces of vector-valued functions,…
We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…
We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…