Related papers: Monomial arrow removal and the finitistic dimensio…
We develop a finiteness notion for unbounded chain complexes over a commutative noetherian integral domain $R$ employing the Abel summation method. The algebraic K-theory of such complexes is defined, and shown to be non-trivial. We also…
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We compute the number of finite dimensional irreducible modules for the algebras quantizing Nakajima quiver varieties. We get a lower bound for all quivers and vectors of framing and provide an exact count in the case when the quiver is of…
In this paper, we explain a strategy on $g$-vectors to discover some new minimal $\tau$-tilting infinite two-point algebras. Consequently, the $\tau$-tilting finiteness of various two-point monomial algebras, including all radical cube zero…
In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed dimension over a given finite field. We show how this method works for the explicit example of $2$-dimensional algebras over the…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We show that the finitistic dimension conjecture holds for all finite dimensional algebras if and only if, for all finite dimensional algebras, the finitistic dimension of an algebra being finite implies that the finitistic dimension of its…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
We establish a new, fairly general cancellativity criterion for a presented monoid that properly extends the previously known related criteria. It is based on a new version of the word transformation called factor reversing, and its…
For an abelian variety $A$ over a number field we study bounds depending only on the dimension of $A$ for the minimal degree $d(A)$ of a field extension over which $A$ acquires semi-stable reduction. We first compute $d(A)$ in terms of the…
Let X be a smooth projective variety. Starting with a finite set of cycles on powers X^m of X, we consider the Q-vector subspaces of the Q-linear Chow groups of the X^m obtained by iterating the algebraic operations and pullback and push…
We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
It is proved that equalities between arrows assumed for cartesian categories are maximal in the sense that extending them with any new equality in the language of free cartesian categories collapses a cartesian category into a preorder. An…