Related papers: Generalised Burnside and Dixon algorithms for irre…
We introduce an infinite-dimensional affine group and construct its irreducible unitary representation. Our approach follows the one used by Vershik, Gelfand and Graev for the diffeomorphism group, but with modifications made necessary by…
Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…
We study the problem of estimating precision matrices in Gaussian distributions that are multivariate totally positive of order two ($\mathrm{MTP}_2$). The precision matrix in such a distribution is an M-matrix. This problem can be…
For linear systems $Ax=b$ we develop iterative algorithms based on a sketch-and-project approach. By using judicious choices for the sketch, such as the history of residuals, we develop weighting strategies that enable short recursive…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
An implicit neural representation (INR) is a neural network that approximates a spatiotemporal function. Many memory-intensive visualization tasks, including modern 4D CT scanning methods, represent data natively as INRs. While INRs are…
Clustering functional data is a challenging task due to intrinsic infinite-dimensionality and the need for stable, data-adaptive partitioning. In this work, we propose a clustering framework based on Random Projections, which simultaneously…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
In todays world, high-power computing applications such as image processing, digital signal processing, graphics, and robotics require enormous computing power. These applications use matrix operations, especially matrix multiplication.…
We describe an approach, via Malle's permutation $\Psi$ on the set of irreducible characters $\text{Irr}(W)$, that gives a uniform derivation of the Chapuy-Stump formula for the enumeration of reflection factorizations of the Coxeter…
There is a decomposition of a Lie algebra for open matrix chains akin to the triangular decomposition. We use this decomposition to construct unitary irreducible representations. All multiple meson states can be retrieved this way.…
In this paper we obtain the orthogonality relations for the supergroup U(m|n), which are remarkably different from the ones for the U(N) case. We extend our results for ordinary representations, obtained some time ago, to the case of…
Convergence guarantees of many resilient consensus algorithms are based on the graph theoretic properties of $r$- and $(r,s)$-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number…
This paper is a continuation of two previous papers in MSJ Memoirs, Vol.\,29 (Math. Soc. Japan, 2013) with the same title and numbered as I and II. Based on the hereditary property given there, from mother groups $G(m,1,n)$, the generalized…
Following Gluck and Wolf we complete the It\^o--Michler's Theorem for the projective representations of a $p$-solvable or $\pi$-separable group, and then we relate the projective irreducible modules of such a group with those of its Sylow…
In this paper, we prove Lusztig's conjecture for finite special linear groups, i.e., we show that characteristic functions of character sheaves coincide with almost characters up to scalar constants, under the condition that the…
We study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on surfaces, modular forms and multiplicities in…
A method for the local and global interpretation of a black-box model on the basis of the well-known generalized additive models is proposed. It can be viewed as an extension or a modification of the algorithm using the neural additive…
We consider a sketched implementation of the finite element method for elliptic partial differential equations on high-dimensional models. Motivated by applications in real-time simulation and prediction we propose an algorithm that…