Related papers: Extending the Veblen Function
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and…
We prove implicit function theorems for mappings on topological vector spaces over valued fields. In the real and complex cases, we obtain implicit function theorems for mappings from arbitrary (not necessarily locally convex) topological…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
We identity the optimal non-infinitesimal direction of descent for a convex function. An algorithm is developed that can theoretically minimize a subset of (non-convex) functions.
Gradients are natural first order differential operators depending on Riemannian metrics. The principal symbols of them are related to the enveloping algebra and higher Casimir elements. We give certain relations in the enveloping algebra,…
Let $\Gamma$ be a totally ordered group. We use Hahn's embedding theorem to construct a totally ordered set $\Gamma\subset \Gamma_{\operatorname{sme}}$ which classifies small extensions of $\Gamma$. This small-extensions closure…
In this paper, we investigate the power of nearly purely operational techniques in the study of umbral calculus. We present a concise reconstruction of the theory based on a systematic use of linear operators, with particular attention to…
We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…
We revisit, clarify, and generalise classical results of Dickson and (much later) Wagner on minimal Sym(n)- and Alt(n)-modules. We present a new, natural notion of 'modules with an additive dimension' covering at once the classical,…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…
We develop a calculus of variations for functionals on certain spaces of conformal maps. Such a space \Omega\ is composed of all maps that are conformal on domains containing a fix compact annular set of the Riemann sphere, and that are…
We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…
We consider the deconstruction/reconstruction of extensions in varieties of algebras which are modules expanded by multilinear operators. The parametrization of extensions determined by abelian ideals with unary actions agrees with the…
The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…
The technique of Caffarelli and Silvestre, characterizing the fractional Laplacian as the Dirichlet-to-Neumann map for a function U satisfying an elliptic equation in the upper half space with one extra spatial dimension, is shown to hold…
With view to applications, we establish a correspondence between two problems: (i) the problem of finding continuous positive definite extensions of functions $F$ which are defined on open bounded domains $\Omega$ in $\mathbb{R}$, on the…
This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of…
We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
In this paper we want to revive the object sectional matrix which encodes the Hilbert functions of successive hyperplane sections of a homogeneous ideal. We translate and/or reprove recent results in this language. Moreover, some new…