Related papers: Partitions and compositions over finite fields
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
Let $N$ denote the number of solutions to the generalized Markoff-Hurwitz-type equation \[(a_1X_1^m+\cdots + a_nX_n^m+a)^k=bX_1\cdots X_n \] over the finite field $\mathbb{F}_q$, where $m,k$ are positive integers, and $a,b,a_i\in…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We analyze a new framework for expressing finite element methods on arbitrarily many intersecting meshes: multimesh finite element methods. The multimesh finite element method, first presented in [40], enables the use of separate meshes to…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
Over an algebraically closed field, we describe the affine varieties of solutions to the linear equations $a(xb)=c$ and $a(bx)=c$ over the split-octonions. We also determine the dimensions of the solution sets of arbitrary linear monomial…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.
This work proposes two nodal type nonconforming finite elements over convex quadrilaterals, which are parts of a finite element exact sequence. Both elements are of 12 degrees of freedom (DoFs) with polynomial shape function spaces…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
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…
In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…
A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no…
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these…
We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…
Finite nonassociative division algebras (i.e., finite semifields) with 243 elements are completely classified.