Related papers: The search for small association schemes with nonc…

A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the…

In this paper we discuss different properties of noncommutative schemes over a field. We define a noncommutative scheme as a differential graded category of a special type. We study regularity, smoothness and properness for noncommutative…

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…

For nonrelativistic Hamiltonians which are shape invariant, analytic expressions for the eigenvalues and eigenvectors can be derived using the well known method of supersymmetric quantum mechanics. Most of these Hamiltonians also possess…

The paper presents a subclass of the class of MD5-algebras and MD5-groups, i.e. five dimensional solvable Lie algebras and Lie groups such that their orbits in the co-adjoint representation (K-orbits) are orbits of zero or maximal…

An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and…

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…

We describe some numerical experiments which determine the degree of spectral instability of medium size randomly generated matrices which are far from self-adjoint. The conclusion is that the eigenvalues are likely to be intrinsically…

An irreducible character $\chi$ of an association scheme is called nonlinear if the multiplicity of $\chi$ is greater than $1$. The main result of this paper gives a characterization of commutative association schemes with at most two…

It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be…

We define modular Terwilliger algebras of association schemes, Terwilliger algebras over a positive characteristic field, and consider basic properties. We give a condition for the modular Terwilliger algebra to be non-semisimple. We show…

Identifiability concerns finding which unknown parameters of a model can be quantified from given input-output data. Many linear ODE models, used in systems biology and pharmacokinetics, are unidentifiable, which means that parameters can…

In this paper we describe a general, computationally feasible strategy to deduce a family of interpolatory non-stationary subdivision schemes from a symmetric non-stationary, non-interpolatory one satisfying quite mild assumptions. To…

There exists two types of nonassociative algebras whose associator satisfies a symmetric relation associated with a 1-dimensional invariant vector space with respect to the natural action of the symmetric group on three elements. The first…

In recent years, data dimensionality has increasingly become a concern, leading to many parameter and dimension reduction techniques being proposed in the literature. A parameter-wise co-clustering model, for data modelled via continuous…

Terwilliger algebras are a subalgebra of a matrix algebra constructed from an association scheme. Rie Tanaka defined what it means for a Terwilliger algebra to be almost commutative and gave five equivalent conditions. In this paper we…