Related papers: Higher arithmetic on the ordinals
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
The aim of this note, which raises more questions than it answers, is to study natural operations acting on the cohomology of various types of algebras. It contains a lot of very surprising partial results and examples.
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
Unifying several directions of the development of the study of summing multilinear operators between Banach spaces, we construct a general framework that studies, under one single definition, multilinear operators that are summing with…
Ordinal data analysis is an interesting direction in machine learning. It mainly deals with data for which only the relationships `$<$', `$=$', `$>$' between pairs of points are known. We do an attempt of formalizing structures behind…
We define the field $\mathbb{L}$ of logarithmic hyperseries, construct on $\mathbb{L}$ natural operations of differentiation, integration, and composition, establish the basic properties of these operations, and characterize these…
There exists a huge number of numerical methods that iteratively construct approximations to the solution $y(x)$ of an ordinary differential equation (ODE) $y'(x)=f(x,y)$ starting from an initial value $y_0=y(x_0)$ and using a finite…
The operational calculus associated with Hermite numbers has been shown to be an effective tool for simplifying the study of special functions. Within this context, Hermite polynomials have been viewed as Newton binomials, with the…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…
Several quantum systems have been used in the last few years to extend supersymmetry. In this paper we show all this systems fit into the picture of what we call "Number Operator Algebras".
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
Differintegral methods, currently exploited in calculus, provide a fairly unexhausted source of tools to be applied to a wide class of problems involving the theory of special functions and not only. The use of integral transforms of Borel…
In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…
We study higher-order elliptic operators on one-dimensional ramified structures (networks). We introduce a general variational framework for fourth-order operators that allows us to study features of both hyperbolic and parabolic equations…
In this article, intended for the Handbook of Recursion Theory, we survey recursion theory on the ordinal numbers, with sections devoted to $\alpha$-recursion theory, $\beta$-recursion theory and the study of the admissibility spectrum.
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
We generalize an operation described by Sloane on the binary representation of an integer to other bases, thus finding several new sequences.
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…