Related papers: Elementary real analysis without compactness argum…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…
This paper will primarily present a method of proving generating function identities for partitions from linked partition ideals. The method we introduce is built on a conjecture by George Andrews and that those generating functions satisfy…
We prove the existence theorem for basic elements in the quasi-projective case, extending results of Eisenbud-Evans and Bruns from the affine case. We give several geometric applications. For example, we show that every local complete…
Partitions with initial repetitions were introduced by George Andrews. We consider a subclass of these partitions and find Legendre theorems associated with their respective partition functions. The results in turn provide partition…
We propose a conceptually economical and computationally tractable completion of the foundations of gauge theory on quantum principal bundles \`{a} la Brzezi\'{n}ski--Majid to the case of general differential calculi and strong bimodule…
In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…
In this Comment we show that Cabello's argument [Phys. Rev. Lett. 86, 1911 (2001)] which proves the nonlocal feature of any classical model of quantum mechanics based on Einstein-Podolsky-Rosen (EPR) criterion of elements of reality, must…
It seems that the index theory for non-compact spaces has found its ultimate formulation in realm of coarse spaces and $K$-theory of related operator algebras. Relative and partitioned index theorems may be mentioned as two important and…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
We prove a generalized version of Renault's theorem for Cartan subalgebras. We show that the original assumptions of second countability and separability are not needed. This weakens the assumption of topological principality of the…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
The logical inference approach to quantum theory, proposed earlier [Ann. Phys. 347 (2014) 45-73], is considered in a relativistic setting. It is shown that the Klein-Gordon equation for a massive, charged, and spinless particle derives from…
Using a graph representation of classical logic, the paper shows that the liar or Yablo pattern occurs in every semantic paradox. The core graph theoretic result generalizes theorem of Richardson, showing solvability of finite graphs…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…