Related papers: On schemes evinced by generalized additive decompo…

We propose a general method for constructing boundary integrable Gaudin models associated with (twisted) affine algebras ${\cal G}^{(k)} (k=1, 2)$, where ${\cal G}$ is a simple Lie algebra or superalgebra. Many new integrable Gaudin models…

We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

We give a lower bound for the degree of a finite apolar subscheme of a symmetric form F, in terms of the degrees of the generators of the annihilator ideal of F. In the special case, when F is a monomial x_0^d_0 x_2^d_2... x_n^d_n with…

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic 0. In this paper we classify all regular decompositions of $\mathfrak{g}$ and its irreducible root system $\Delta$. A regular…

We determine the minimal number of variables $\Gamma^*(d, K)$ which guarantees a nontrivial solution for every additive form of degree $d=2m$, $m$ odd, $m \ge 3$ over the six ramified quadratic extensions of $\mathbb{Q}_2$. We prove that if…

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

Presented here is a preliminary study of a strictly linear, discontinuous-Petrov-Galerkin scheme for the discrete-ordinates method in slab geometry. By ``linear'', we mean the discretization does not depend on the solution itself as is the…

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…

The fundamental theorem of affine geometry is a classical and useful result. For finite-dimensional real vector spaces, the theorem roughly states that a bijective self-mapping which maps lines to lines is affine. In this note we prove…

Let G be a simple simply-connected group scheme over a regular local scheme U. Let E be a principal G-bundle over A^1_U trivial away from a subscheme finite over U. We show that E is not necessarily trivial and give some criteria of…

In the domain of anomaly detection, methods often excel in either high-level semantic or low-level industrial benchmarks, rarely achieving cross-domain proficiency. Semantic anomalies are novelties that differ in meaning from the training…

For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

Given a graph $G$, a decomposition of $G$ is a partition of its edges. A graph is $(d, h)$-decomposable if its edge set can be partitioned into a $d$-degenerate graph and a graph with maximum degree at most $h$. For $d \le 4$, we are…

The Adomian decomposition method (ADM) is a universal approach to solving governing equations in various engineering and technological applications. The applicability of the ADM is almost limitless due to its universal applicability, but…

Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…