Related papers: Counting subspaces of a finite vector space
We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…
We prove some results concerning the finitely additive, vector integral of Bochner and Pettis and their representation over a countably additive probability space. Applications to convergence of vector valued martingales and to the non…
Bender, Coley, Robbins and Rumsey posed the problem of counting the number of subspaces which have a given profile with respect to a linear endomorphism defined on a finite vector space. Several special cases of this problem have been…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…
We answer a question by Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields by proving a conjecture by Ghorpade and Ram.
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…
For any finite poset we define a generating polynomial counting upsets, downsets, and their intersection. We investigate the behaviour of this polynomial with respect to poset operations, show that it distinguishes series-parallel posets,…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
Principal angles are used to define an angle bivector of subspaces, which fully describes their relative inclination. Its exponential is related to the Clifford geometric product of blades, gives rotors connecting subspaces via minimal…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
We study the discrepancy between the distribution of a vector-valued functional of i.i.d. random elements and that of a Gaussian vector. Our main contribution is an explicit bound on the convex distance between the two distributions,…
In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…
This expository essay is aimed at introducing the Jones polynomial. We will see the encapsulation of the Jones polynomial, which will involve topics in functional analysis and geometrical topology; making this essay an interdisciplinary…
We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
We show how Viennot's combinatorial theory of orthogonal polynomials may be used to generalize some recent results of Sukumar and Hodges on the matrix entries in powers of certain operators in a representation of su(1,1). Our results link…
In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.