Related papers: Generalised regularisation maps on partitions

Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive…

In this paper, we consider the possible types of regular maps of order $2^n$, where the order of a regular map is the order of automorphism group of the map. For $n \le 11$, M. Conder classified all regular maps of order $2^n$. It is easy…

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements…

Let $R$ be a commutative ring with identity and $G$ a graph. An extending generalized spline on $G$ is a vertex labeling $f \in \prod_{v} M_v$, where for each edge $e=uv$ there exists an $R$-module $M_{uv}$ together with homomorphisms $…

E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and…

A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

In ``Rips complexes and covers in the uniform category'' the authors define, following James, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform…

We reformulate dimensional regularization as a regularization method in position space and show that it can be used to give a closed expression for the renormalized time-ordered products as solutions to the induction scheme of…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

The notion of Image partition regularity near zero was first introduced by De and Hindman. It was shown there that like image partition regularity over $\mathbb{N}$ the main source of infinite image partition regular matrices near zero are…

A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

One introduces a class of projective parameterizations that resemble generalized de Jonqui\`eres maps. Any such parametrization defines a birational map $\mathfrak{F}$ of $\pp^n$ onto a hypersurface $V(F)\subset \pp^{n+1}$ with a strong…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

Regularization is one of the crucial ingredients of deep learning, yet the term regularization has various definitions, and regularization methods are often studied separately from each other. In our work we present a systematic, unifying…

In his 1963 paper, Dirac [1] gave `A Remarkable Representation of the 3 + 2 de- Sitter Group'. We reproduce this representation using a generalised Jordan map which is motivated by the infinitesimal symplectic transformations related to the…

We study the evolution equations for a regularized version of Dirac-harmonic maps from closed Riemannian surfaces. We establish the existence of a global weak solution for the regularized problem, which is smooth away from finitely many…