Related papers: Enumeration of Splitting Subspaces over Finite Fie…
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…
We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…
Grothendieck-Birkhoff Theorem states that every finite dimensional vector bundle over the projective line splits as the sum of one dimensional vector bundles. In this work we study simultaneous splittings of two dimensional vector bundles…
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…
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…
We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…
In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
Projective spaces for finite-dimensional vector spaces over general fields are considered. The geometry of these spaces and the theory of line bundles over these spaces is presented. Particularly, the space of global regular sections of…
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…
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…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
We study extensions and generalizations of the Schmidt Subspace Theorem in various settings. In particular, we prove results for algebraic points of bounded degree, giving a sharp version of Schmidt's theorem for quadratic points in the…
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…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…
We discuss a special class of solutions to the minimal surface system. These are vector-valued functions that "decrease area" and are natural generalization of scalar functions. After defining area-decreasing maps, we show several classical…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
We study a matrix analog of the Erd\H{o}s-Falconer distance problems in vector spaces over finite fields. There arises an interesting analysis of certain quadratic matrix Gauss sums.