Related papers: Prenex normal form theorems in semi-classical arit…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…
We give an alternative method to obtain normal forms of reversible equivariant vector fields. We adapt the classical method using tools from invariant theory to establish formulae that take symmetries into account as a starting point.…
We study algebraic and topological properties of subsets of preorders on a group. In particular we study properties of the composition of two preorders, generalize a topological theorem of \cite{S} in the case of standard orders and show…
We compute the associated prime ideals of the normalization modulo the ring, and establish connections between different types of generalizations (resp. specializations) of the normalization. This has some applications. For example, we…
Let S=K[x_1,...,x_n] be a polynomial ring. Denote by $p_a$ the power sum symmetric polynomial x_1^a+...+x_n^a. We consider the following two questions: Describe the subsets $A \subset \mathbb{N}$ such that the set of polynomials $p_a$ with…
We extend the formal framework of classifier models used in the legal domain. While the existing classifier framework characterises cases solely through the facts involved, legal reasoning fundamentally relies on both facts and rules,…
The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
A simple normal form for Hardy operators is introduced that unifies and simplifies the theory of weighted Hardy inequalities. A straightforward transition to normal form is given that applies to the various Hardy operators and their duals,…
We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
The central limit theorem, the invariance principle and the Poisson limit theorem for the hierarchy of freeness are studied. We show that for given natural m the limit laws can be expressed in terms of non-crossing partitions of depth…
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
We investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…
We survey the classical results on the prime number theorem
This paper revisits the solution of the word problem for $\omega$-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond's algorithm, based on normal forms for such…
In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…
Our goal in this work is to present some mean value type theorems that are not studied in classic calculus and analysis courses. They are simple theorems yet with large applicability in mathematical analysis (for example, in the study of…