Related papers: Elementary real analysis without compactness argum…
A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We present solutions to additive and multiplicative Cousin problems formulated on an axially symmetric domain $\Omega \subset \mathbb H$ for slice--regular functions starting from the solutions for subclasses, namely slice--regular…
We present an innovative approach to dimensional analysis, based on a general representation theorem for complete quantity functions admitting a covariant scalar representation; this theorem is in turn grounded in a purely algebraic theory…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…
It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative…
We provide a compactness principle which is applicable to different formulations of Plateau's problem in codimension one and which is exclusively based on the theory of Radon measures and elementary comparison arguments. Exploiting some…
We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…
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…
The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…
The B-series composition theorem has been an important topic in numerical analysis of ordinary differential equations for the past-half century. Traditional proofs of this theorem rely on labelled trees, whereas recent developments in…
Schm\"udgen's Theorem says that if a basic closed semialgebraic set K = {g_1 \geq 0, ..., g_s \geq 0} in R^n is compact, then any polynomial f which is strictly positive on K is in the preordering generated by the g_i's. Putinar's Theorem…
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…
We present a simple yet rigorous theory of integration that is based on two axioms rather than on a construction involving Riemann sums. With several examples we demonstrate how to set up integrals in applications of calculus without using…
The aim of this note is to give a quick algebraic proof of (the combinatorial part of) the classification theorem for compact real surfaces, whose classical proofs (as in the Massey book and in the Conway ZIP proof) are based on surgery…
Let G be a quasisimple algebraic group over an algebraically closed field of characteristic p>0. We suppose that p is very good for G; since p is good, there is a bijection between the nilpotent orbits in the Lie algebra and the unipotent…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…