Related papers: Generalised regularisation maps on partitions
We classify the pairs of conjugate partitions whose regularisations are images of each other under the Mullineux map. This classification proves a conjecture of Lyle, answering a question of Bessenrodt, Olsson and Xu.
The Mullineux involution is an important map on $p$-regular partitions that originates from the modular representation theory of $\mathcal{S}_n$. In this paper we study the Mullineux transpose map and the generalized column regularization…
In this paper, we consider linear ill-posed problems in Hilbert spaces and their regularization via frame decompositions, which are generalizations of the singular-value decomposition. In particular, we prove convergence for a general class…
This work presents a generalized notion of multiset mapping thus resolving a long standing obstacle in structural study of multiset processing. It has been shown that the mapping defined herein can model a vast array of notions as special…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
We introduce a simple procedure to integrate differential forms with arbitrary holomorphic poles on Riemann surfaces. It gives rise to an intrinsic regularization of such singular integrals in terms of the underlying conformal geometry.…
We use localization techniques to calculate the Euclidean partition functions for $\mathcal{N}=1$ theories on four-dimensional manifolds $M$ of the form $S^1 \times M_3$, where $M_3$ is a circle bundle over a Riemann surface. These are…
The Mullineux map is a combinatorial function on partitions which describes the effect of tensoring a simple module for the symmetric group in characteristic $p$ with the one-dimensional sign representation. It can also be interpreted as an…
The aim of this note is to study a generalization of theorems by James and Fayers on the modular representations of the symmetric group and its Hecke algebra to the case of the complex reflection groups of type $G(l,1,n)$ and the associated…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral dimensionality reduction. However, as a first-order regularizer, it can lead to degenerate functions in high-dimensional manifolds. The…
This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…
We define a generalized Jacobian $\mathrm{J}_\mathfrak{m}(\mathit{Gr})$ and a generalized Picard group $\mathrm{P}_\mathfrak{m}(\mathit{Gr})$ of a graph $\mathit{Gr}$ with respect to a modulus $ \mathfrak{m}=\sum_{i=1}^s m_iw_i$ with $w_i$…
Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component…
Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…