Related papers: Analysis of systematic scan Metropolis algorithms …
We continue the study of Specht modules labelled by hook bipartitions for the Iwahori--Hecke algebra of type $B$ with $e\in\{3,4,\dots\}$ via the cyclotomic Khovanov--Lauda--Rouquier algebra $\mathscr{H}_n^{\Lambda}$. Over an arbitrary…
This is an expository paper on the helicoidal method, a tool designed for proving multiple vector-valued inequalities for operators in harmonic analysis, which is based on stopping times and localizations. As it turns out, the local…
In this paper, a simple proof for the existence iterative scheme by using two Hilbert spaces due to Kazmi et al. [K. R. Kazmi, R. Ali, M. Furkan, Hybrid iterative method for split monotone \ldots, Numer Algor, 2017] is provided.
Stochastic hydrodynamics provides a dynamical framework for the evolution of fluctuations in heavy-ion collisions, but poses significant challenges in numerical simulations. We present an algorithm for the simulation of non-relativistic…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We propose a novel Metropolis-Hastings algorithm to sample uniformly from the space of correlation matrices. Existing methods in the literature are based on elaborated representations of a correlation matrix, or on complex parametrizations…
In this paper, we present experimental algorithms for solving the dualization problem. We present the results of extensive experimentation comparing the execution time of various algorithms.
This paper reports on a simple pure numerical method developed for computing Hansen coefficients by using recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for…
Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.
This paper shows that the Heterogeneous Multiscale Method can be applied to elliptic problem without scale separation. The Localized Orthogonal Method is a special case of the Heterogeneous Multiscale Method.
We empirically analyze a simple heuristic for large sparse set cover problems. It uses the weighted greedy algorithm as a basic building block. By multiplicative updates of the weights attached to the elements, the greedy solution is…
Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…
This paper discusses the challenges presented by tall data problems associated with Bayesian classification (specifically binary classification) and the existing methods to handle them. Current methods include parallelizing the likelihood,…
In this paper we prove the Dipper-James conjecture that the centre of the Iwahori-Hecke algebra of type A is the set of symmetric polynomials in the Jucys-Murphy operators.
A method is presented to exploit adaptive integration algorithms using importance sampling, like VEGAS, for the task of scanning theoretical predictions depending on a multi-dimensional parameter space. Usually, a parameter scan is…
Hecke algebras are usually defined algebraically, via generators and relations. We give a new algebro-geometric construction of affine and double-affine Hecke algebras (the former is known as the Iwahori-Hecke algebra, and the latter was…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that…