Related papers: A simple proof of the representation theorem for b…
We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.
Betweenness as a relation between three individual points has been widely studied in geometry and axiomatized by several authors in different contexts. The article proposes a more general notion of betweenness as a relation between three…
In this work we show that the ordering ambiguity on quantization depends on the representation choice. This property is then used to solve unambiguously some particular systems. Finally, we speculate on the consequences for more involved…
An evidential reasoning mechanism based on the Dempster-Shafer theory of evidence is introduced. Its performance in real-world image analysis is compared with other mechanisms based on the Bayesian formalism and a simple weight combination…
We give an axiomatic framework for studying the representation theory of towers of algebras. We introduce a new class of algebras, contour algebras, generalising (and interpolating between) blob algebras and cyclotomic Temperley-Lieb…
Knowledge representation is a popular research field in IT. As mathematical knowledge is most formalized, its representation is important and interesting. Mathematical knowledge consists of various mathematical theories. In this paper we…
In this paper we generalize the comparison theorem of Hecht and Taylor to arbitrary parabolic subalgebras of a complex reductive Lie algebra and then apply our generalized comparison theorem to obtain results about the geometric realization…
The purpose of this note is to prove the celebrated Discrete Renewal Theorem in a common special case. We use only very elementary methods from real analysis, rather than markov chain theory, complex analysis, or generating functions.…
A weak bialgebra is known to be a special case of a bialgebroid. In this paper we study the relationship of this fact with the Tannaka theory of bialgebroids as developed in [4]. We obtain a Tannaka representation theorem with respect to a…
Explicit expressions for the Temperley-Lieb-Martin algebras, i.e., the quotients of the Hecke algebra that admit only representations corresponding to Young diagrams with a given maximum number of columns (or rows), are obtained, making…
Recently Alan D. Sokal gave a very short and completely elementary proof of the uniform boundedness principle. The aim of this note is to point out that by using a similiar technique one can give a considerably short and simple proof of a…
In 1976, Appel and Haken achieved a major break through by proving the four color theorem $(4CT)$. Their proof is based on studying a large number of cases for which a computer-assisted search for hours is required. In 1997, Robertson,…
We determine the representations of the Yokonuma-Temperley-Lieb algebra, which is defined as a quotient of the Yokonuma-Hecke algebra by generalising the construction of the classical Temperley-Lieb algebra.
First proved my Donald Martin in 1975, the result of Borel determinacy has been the subject of multiple revised proofs. Following Martin's book [1], we present a recent streamlined proof which implements ideas of Martin, Moschovakis, and…
We prove without appeal to the Axiom of Choice that for any sets A and B, if there is a one-to-one correspondence between 3 cross A and 3 cross B then there is a one-to-one correspondence between A and B. The first such proof, due to…
This is an introduction to the theory of disconjugacy for a second order linear differential equation. We give new proofs of some of basic results and obtain new sufficient conditions for disconjugacy (in particular, on the whole real…
A theorem of J. Kruskal from 1977, motivated by a latent-class statistical model, established that under certain explicit conditions the expression of a 3-dimensional tensor as the sum of rank-1 tensors is essentially unique. We give a new…
We prove a partition identity conjectured by Lassalle (Adv. in Appl. Math. 21 (1998), 457-472).
We give a pen and paper and (comparatively) much simpler proof to verify of the Four Colour Theorem.
As a first application of a very old theorem, known as Herschel's theorem, we provide direct elementary proofs of several explicit expressions for some numbers and polynomials that are known in combinatorics. The second application deals…