Related papers: Generalised regularisation maps on partitions
V. I. Arnold [Russian Math. Surveys 26, no. 2, 1971, 29-43] constructed smooth generic families of matrices with respect to similarity transformations depending smoothly on the entries of matrices and got bifurcation diagrams of such…
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most…
Geometric algebras of dimension $n < 6$ are becoming increasingly popular for the modeling of 3D and 3+1D geometry. With this increased popularity comes the need for efficient algorithms for common operations such as normalization, square…
Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…
In this note, we study a factorization result for graded decomposition maps associated with the specializations of graded algebras. We obtain results previously known only in the ungraded setting.
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
We review recent results that lead to a very precise understanding of the dynamics of typical unimodal maps from the statistical point of view. We also describe the (generalized) renormalization approach to the study of the statistical…
Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.
We define a certain compactifiction of the general linear group and give a modular description for its points with values in arbitrary schemes. This is a first step in the construction of a higher rank generalization of Gieseker's…
We prove a new `runner removal theorem' for $q$-decomposition numbers of the level 1 Fock space of type $A^{(1)}_{e-1}$, generalising earlier theorems of James--Mathas and the author. By combining this with another theorem relating to the…
We take a geometrical viewpoint and present a unifying view on supervised deep learning with the Bregman divergence loss function - this entails frequent classification and prediction tasks. Motivated by simulations we suggest that there is…
Inspired by cartographic generalization principles, we present a generalization technique for rendering line charts at different sizes, preserving the important semantics of the data at that display size. The algorithm automatically…
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
We introduce several possible generalizations of tomography for quadratic surfaces. We analyze different types of elliptic, hyperbolic and hybrid tomograms. In all cases it is possible to consistently define the inverse tomographic map. We…
On the basis of the classical theory of envelopes, we formulate the renormalization group (RG) method for global analysis, recently proposed by Goldenfeld et al. It is clarified why the RG equation improves things.
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
Despite the advances in the development of numerical methods analytical approaches still play the key role on the way towards a deeper understanding of many-particle systems. In this regards, diagonalization schemes for Hamiltonians…