Related papers: Complexity, Periodicity and One-Parameter Subgroup…

Combining results from Keller and Buchweitz, we describe the 1-periodic derived category of a finite dimensional algebra $A$ of finite global dimension as the stable category of maximal Cohen-Macaulay modules over some Gorenstein algebra…

We define the notion of inseparable coverings of schemes and we propose a ramification formalism for them, along the lines of the classical one. Using this formalism we prove a formula analogous to the classical Riemann-Hurwitz formula for…

The main result of this note is that the shift of the parameter by 1 in the parameter space of decomposing measures in the problem of harmonic analysis on the infinite-dimensional unitary group corresponds to the taking of the reduced Palm…

We use a 1-parameter version of gauge theory to investigate the topology of the diffeomorphism group of 4-manifolds. A polynomial invariant, analogous to the Donaldson polynomial, is defined, and is used to show that the diffeomorphism…

We introduce an infinite family of quiver representation-valued invariants of classical, virtual and surface-knots and links associated to a choice of finite biquandle, commutative unital ring, biquandle module and set of biquandle…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…

Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…

We define the associated variety $ X_{M} $ of a module $ M $ over a finite-dimensional superalgebra $ {\mathfrak g} $, and show how to extract information about $ M $ from these geometric data. $ X_{M} $ is a subvariety of the cone $ X $ of…

A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

We consider the infinite symmetric group and its infinite index subgroup given as the stabilizer subgroup of one element under the natural action on a countable set. This inclusion of discrete groups induces a hyperfinite subfactor for each…

We explicitly construct and list all unitary superconformal multiplets, along with their index contributions, in five and six dimensions. From this data, we uncover various unifying themes in the representation theory of five- and…

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

We find new families of shape invariant potentials depending on n>=1 parameters subject to translation by the inclusion of non-trivial invariants. New dependencies of the spectra are found, and it opens the door to the engineering of…

In this article we consider the behavior in the vicinity of infinity of the class of all planar quadratic differential systems. This family depends on twelve parameters but due to action of the affine group and re-scaling of time the family…

Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…

The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which…

Let $k$ be an algebraically closed field of characteristic $0$ or $p>2$. Let $\mathcal{G}$ be an affine supergroup scheme over $k$. We classify the indecomposable exact module categories over the tensor category ${\rm sCoh}_{\rm…

We study the algebras generated by restriction and induction operations on complex modules over dihedral groups. In the case where the orders of all dihedral groups involved are not divisible by four, we describe the relations, a basis, the…