Related papers: Constructive basic theory of central simple algebr…

In Sternfeld's work on Kolmogorov's Superposition Theorem appeared the combinatorial-geometric notion of a basic set and a certain kind of arrays. A subset $X \subset \mathbb R^n$ is basic if any continuous function $X\to \mathbb R$ could…

We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…

We prove some constructive results that on first and maybe even on second glance seem impossible.

We enumerate smooth rational curves on very general Weierstrass fibrations over hypersurfaces in projective space. The generating functions for these numbers lie in the ring of classical modular forms. The method of proof uses topological…

This paper shows an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima and the Binomial Formula, that avoids: any root extraction other than the one used to define the modulus…

A weak version of Birkhoff's generalization of the Perron-Frobenius theorem states that every endomorphism of a finite-dimensional real vector that leaves invariant a non-degenerate closed convex cone has an eigenvector in that cone. Here,…

We introduce notions of open-string vertex algebra, conformal open-string vertex algebra and variants of these notions. These are ``open-string-theoretic,'' ``noncommutative'' generalizations of the notions of vertex algebra and of…

The theory of regularity structures sets up an abstract framework of modelled distributions generalising the usual H\"older functions and allowing one to give a meaning to several ill-posed stochastic PDEs. A key result in that theory is…

The constructive approach to mathematics has the advantage that witnesses can be extracted from statements of existence and theorems can be unwound to give algorithms. Even better, constructive theorems can be interpreted in any topos,…

We use standard constructions in algebraic geometry and homological algebra to extend the decomposition and hard Lefschetz theorems of T. Mochizuki and C. Sabbah so that they remains valid without the quasi-projectivity assumptions.

The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…

Almost two decades ago, Wattenberg published a paper with the title 'Nonstandard Analysis and Constructivism?' in which he speculates on a possible connection between Nonstandard Analysis and constructive mathematics. We study Wattenberg's…

In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…

Let $A=A_1\oplus\cdots\oplus A_r$ be a decomposition of the algebra $A$ as a direct sum of vector subspaces. If for every choice of the indices $1\le i_j\le r$ there exist $a_{i_j}\in A_{i_j}$ such that the product $a_{i_1}\cdots a_{i_n}\ne…

It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…

In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…

In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…