Related papers: Computational Bounds for Doing Harmonic Analysis o…
We introduce the notion of integrable modules over $\imath$quantum groups (a.k.a. quantum symmetric pair coideal subalgebras). After determining a presentation of such modules, we prove that each integrable module over a quantum group is…
The period is a classical complex analytic invariant for a compact Riemann surface defined by integration of differential 1-forms. It has a strong relationship with the complex structure of the surface. In this chapter, we review another…
In this work, we consider the maximization of submodular functions constrained by independence systems. Because of the wide applicability of submodular functions, this problem has been extensively studied in the literature, on specialized…
Let $f: \CN \rightarrow \C $ be a reduced polynomial map, with $D=f^{-1}(0)$, $\U=\CN \setminus D$ and boundary manifold $M=\partial \U$. Assume that $f$ is transversal at infinity and $D$ has only isolated singularities. Then the only…
Iterative methods that operate with the full Hamiltonian matrix in the untrimmed Hilbert space of a finite system continue to be important tools for the study of one- and two-dimensional quantum spin models, in particular in the presence of…
Robust Optimization is becoming increasingly important in machine learning applications. This paper studies the problem of robust submodular minimization subject to combinatorial constraints. Constrained Submodular Minimization arises in…
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…
Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous…
We give new upper bounds for the diameters of finite groups which do not depend on a choice of generating set. Our method exploits the commutator structure of certain profinite groups, in a fashion analogous to the Solovay-Kitaev procedure…
For the computational model where only additions are allowed, the $\Omega(n^2\log n)$ lower bound on operations count with respect to image size $n\times n$ is obtained for two types of the discrete Radon transform implementations: the fast…
We initiate a formal study of reproducibility in optimization. We define a quantitative measure of reproducibility of optimization procedures in the face of noisy or error-prone operations such as inexact or stochastic gradient computations…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
We organize fundamental properties of quasi-Hamiltonian spaces on which a finite group acts, and we apply them to the theory of moduli spaces of flat connections on an oriented compact surface with boundary.
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
We define a new invariant of finitely generated representations of a finite group, with coefficients in a commutative noetherian ring. This invariant uses group cohomology and takes values in the singularity category of the coefficient…
Applications of harmonic analysis on finite groups were recently introduced to measure partition problems, with a variety of equipartition types by convex fundamental domains obtained as the vanishing of prescribed Fourier transforms.…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…