Related papers: Non-linearizable Root Group Data
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
We give sufficient conditions such that the exponential stability of the linearization of a non-linear system implies that the non-linear system is (locally) exponentially stable. One of these conditions is that the non-linear system is…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
We prove a super-rigidity result for algebraic representations over complete fields of irreducible lattices in product of groups and lattices with dense commensurator groups. We derive some criteria for non-linearity of such groups.
Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The…
Similarly to how the classical group ring isomorphism problem asks, for a commutative ring $R$, which information about a finite group $G$ is encoded in the group ring $RG$, the twisted group ring isomorphism problem asks which information…
We completely classify Laurent series converging on the unit circle over a non-Archimedean local field (of any characteristic) that map infinitely many roots of unity to roots of unity. For a given Laurent series $f$ over a field of…
A graph is $d$-rigid if for any generic realisation of the graph in $\mathbb{R}^d$ (equivalently, the $d$-dimensional sphere $\mathbb{S}^d$), there are only finitely many non-congruent realisations in the same space with the same edge…
We study a combinatorial object, which we call a GRRS (generalized reflection root system); the classical root systems and GRSs introduced by V. Serganova are examples of finite GRRSs. A GRRS is finite if it contains a finite number of…
We study 2D non-linear sigma models on a group manifold with a special form of the metric. We address the question of integrability for this special class of sigma models. We derive two algebraic conditions for the metric on the group…
Five equivalence classes had been found for systems of two second-order ordinary differential equations, transformable to linear equations (linearizable systems) by a change of variables. An "optimal (or simplest) canonical form" of linear…
A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…
We construct a new family of linearizations of rational matrices $R(\lambda)$ written in the general form $R(\lambda)= D(\lambda)+C(\lambda)A(\lambda)^{-1}B(\lambda)$, where $D(\lambda)$, $C(\lambda)$, $B(\lambda)$ and $A(\lambda)$ are…
We start by constructing a new root system for rational triple singularities and determine the number of roots for each rational triple singularity. Then we show that, for each root, we obtain a linear free divisor. So we obtain a new…
Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
A matrix $M$ over the finite field $ \mathbb{F}_q $ is called \emph{maximum distance separable} (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they…
We consider static, spherically symmetric configurations of nonlinear electromagnetic fields with Lagrangians $L(f)$, where $f = F_{\mu\nu} F^{\mu\nu}$, in general relativity (GR) and other metric theories of gravity. The corresponding…