Related papers: Simplicity of augmentation submodules for transfor…

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

Let $G$ be a discrete group. We give a decomposition theorem for the Hochschild cohomology of $\ell^1(G)$ with coefficients in certain $G$-modules. Using this we show that if $G$ is commutative-transitive, the canonical inclusion of bounded…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…

We consider simple modules over the McConnell--Pettit algebras. We show that both induction and contraction yield simple modules for the extremes of the global dimension.

We study the problem of classification of simple transitive 2-representations for the (non-finitary) 2-category of bimodules over the dual numbers. We show that simple transitive 2-representations with finitary apex are necessarily of rank…

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…

We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.

Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…

We investigate finite non-Abelian simple groups $G$ for which the projective cover of the trivial module coincides with the permutation module on a subgroup and classify all cases unless $G$ is of Lie type in defining characteristic.

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

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…

A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee…

Simple-minded systems of objects in a stable module category are defined by common properties with the set of simple modules, whose images under stable equivalences do form simple-minded systems. Over a representation-finite self-injective…

The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

A sequence of monoidal transformations is defined, in terms of invariants, for a singular hypersurface embedded in a smooth scheme of positive characteristic. Some examples are added to illustrate the improvement of singularities by this…