Related papers: Algorithms on the Pyasetskii involution on local L…
We discuss a new method to solve in a semianalytical way the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi evolution equations at NLO order in the x-space. The method allows to construct an evolution operator expressed in form of a rapidly…
We present a fast algorithm for the subset convolution problem: given functions f and g defined on the lattice of subsets of an n-element set N, compute their subset convolution f*g, defined for all S\subseteq N by (f * g)(S) = \sum_{T…
Let $G_n$ denote either the group $SO(2n+1, F)$, $Sp(2n, F)$, or $GSpin(2n+1, F)$ over a non-archimedean local field of characteristic different than two. We determine all composition factors of degenerate principal series of $G_n$, using…
In this paper, we investigate the large-time behavior for a slightly modified version of the standard p=2 soft spins dynamics model, including a quartic or higher potential. The equilibrium states of such a model correspond to an effective…
We investigate the ill-posed inverse problem of recovering unknown spatially dependent parameters in nonlinear evolution PDEs. We propose a bi-level Landweber scheme, where the upper-level parameter reconstruction embeds a lower-level state…
Multilinear embedding estimates for the fractional Laplacian are obtained in terms of functionals defined over a hyperbolic surface. Convolution estimates used in the proof enlarge the classical framework of the convolution algebra for…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
The goal of this paper is to better understand a family of linear degenerations of the classical Lagrangian Grassmannians $\Lambda(2n)$. It is the special case for $k=n$ of the varieties $X(k,2n)^{sp}$, introduced in previous joint work…
In this paper, we reformulate Moeglin's explicit construction of local A-packets of split odd special orthogonal groups and symplectic groups. By this reformulation together with results of the previous paper with Minguez, we can compute…
We show that the natural "convolution" on the space of smooth, even, translation-invariant convex valuations on a euclidean space $V$, obtained by intertwining the product and the duality transform of S. Alesker, may be expressed in terms…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…
Let $F$ be a non-Archimedean local field of characteristic zero and $G=\GL(2,F)$. Let $n\geq 2$ be a positive integer and $\widetilde{G}=\widetilde{\GL}(2,F)$ be the $n$-fold metaplectic cover of $G$. Let $\pi$ be an irreducible smooth…
Lam suggested that the PMNS matrix (or at least some of its elements) can be predicted by embedding the residual symmetry of the leptonic mass terms into a bigger symmetry. We analyze the possibility that the residual symmetries consist of…
Partial least squares regression (PLSR) has been a popular technique to explore the linear relationship between two datasets. However, most of algorithm implementations of PLSR may only achieve a suboptimal solution through an optimization…
We introduce the {\it Bipartite Multi-cut} problem. This is a generalization of the {\it st-Min-cut} problem, is similar to the {\it Multi-cut} problem (except for more stringent requirements) and also turns out to be an immediate…
We compute the Grothendieck group of certain 2-Calabi--Yau triangulated categories appearing naturally in the study of the link between quiver representations and Fomin--Zelevinsky's cluster algebras. In this setup, we also prove a…
A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been presented by Kratsch and Neumann (2013). In this paper, we extend…
The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…
Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art…