English
Related papers

Related papers: Effective Kohn Algorithm for Special Domain Define…

200 papers

We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…

Quantum Physics · Physics 2022-02-24 Matthew Moore , Grace Young

It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the…

Quantum Physics · Physics 2007-05-23 Jeffrey Bub

We shall explain here an idea to generalize classical complex analytic Kleinian group theory to any odd dimensional cases. For a certain class of discrete subgroups of $\PGL_{2n+1}(\C)$ acting on $\P^{2n+1}$, we can define their domains of…

Complex Variables · Mathematics 2018-09-19 Masahide Kato

A finite difference numerical method is investigated for fractional order diffusion problems in one space dimension. For this, a mathematical model is developed to incorporate homogeneous Dirichlet and Neumann type boundary conditions. The…

Numerical Analysis · Mathematics 2014-11-07 Béla J. Szekeres , Ferenc Izsák

The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…

Algebraic Geometry · Mathematics 2026-04-08 Elia Mazzucchelli , Dmitrii Pavlov , Kexin Wang

For a compact Riemannian surface $(M,g)$ with non-empty boundary $\Gamma$, the Dirichlet-to-Neumann operator (DtN-map) $\Lambda_g:C^\infty(\Gamma)\to C^\infty(\Gamma)$ is defined by $\Lambda_gf=\left.\frac{\partial…

Differential Geometry · Mathematics 2026-02-10 Vladimir A. Sharafutdinov , Konstantin V. Storozhuk

Given a set $Z$ of $n$ positive integers and a target value $t$, the Subset Sum problem asks whether any subset of $Z$ sums to $t$. A textbook pseudopolynomial time algorithm by Bellman from 1957 solves Subset Sum in time $O(nt)$. This has…

Data Structures and Algorithms · Computer Science 2017-01-10 Karl Bringmann

We consider an elliptic Kolmogorov equation lambda u - Ku =f in a convex subset C of a separable Hilbert space X. We prove maximal Sobolev regularity of its weak solution, when lambda >0 and f is in L^2(C,nu), where nu is the log-concave…

Analysis of PDEs · Mathematics 2013-09-26 Giuseppe Da Prato , Alessandra Lunardi

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

Optimization and Control · Mathematics 2026-03-24 Samuel Awoniyi

A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…

Mathematical Physics · Physics 2009-11-07 Miguel A. Rodriguez , Pavel Winternitz

In this paper we are interested on solvability of the problem \begin{align*} \begin{cases} -\Delta u=0 & \text{in} \;\;\;\mathbb{R}^{n+1}_{+}\;\;\;\;\;\;\;\;\;\\ \;\;\displaystyle{\frac{\partial u}{\partial \nu}} = V(x)u+b \vert…

Analysis of PDEs · Mathematics 2021-04-27 Marcelo F. de Almeida , Lidiane S. M. Lima

We establish the strong asymptotics for Bergman orthogonal polynomials defined over Jordan domains with corners. This complements an investigation started in 1923 by T. Carleman, who derived the strong asymptotics for domains bounded by…

Complex Variables · Mathematics 2012-02-07 Nikos Stylianopoulos

In this paper we solve three problems in noncommutative harmonic analysis which are related to endpoint inequalities for singular integrals. In first place, we prove that an $L_2$-form of H\"ormander's kernel condition suffices for the weak…

Classical Analysis and ODEs · Mathematics 2021-07-15 Léonard Cadilhac , José M. Conde-Alonso , Javier Parcet

We present a novel integral-equation algorithm for evaluation of Zaremba eigenvalues and eigenfunctions}, that is, eigenvalues and eigenfunctions of the Laplace operator with mixed Dirichlet-Neumann boundary conditions; of course, (slight…

Numerical Analysis · Mathematics 2016-05-04 Eldar Akhmetgaliyev , Oscar Bruno , Nilima Nigam

Given $(a_1, \dots, a_n, t) \in \mathbb{Z}_{\geq 0}^{n + 1}$, the Subset Sum problem ($\mathsf{SSUM}$) is to decide whether there exists $S \subseteq [n]$ such that $\sum_{i \in S} a_i = t$. There is a close variant of the $\mathsf{SSUM}$,…

Data Structures and Algorithms · Computer Science 2022-06-02 Pranjal Dutta , Mahesh Sreekumar Rajasree

We consider the nonlinear Kolmogorov equation posed in a Hilbert space $H$, not necessarily of finite dimension. This model was recently studied by Cox et al. [24] in the framework of weak convergence rates of stochastic wave models. Here,…

Probability · Mathematics 2022-07-06 Javier Castro

The homogenization of elliptic divergence-type fourth-order operators with periodic coefficients is studied in a (periodic) domain. The aim is to find an operator with constant coefficients and represent the equation through a perturbation…

Numerical Analysis · Mathematics 2024-01-08 Julia Orlik , Heiko Andrä , Sarah Staub

We consider the "Method of particular solutions" for numerically computing eigenvalues and eigenfunctions of the Laplacian $\Delta$ on a smooth, bounded domain Omega in RR^n with either Dirichlet or Neumann boundary conditions. This method…

Spectral Theory · Mathematics 2011-07-13 A. H. Barnett , Andrew Hassell

We propose a new algorithm for Dehn surgery problem, finding exceptional Dehn filling slopes for a given hyperbolic 3-manifold with a torus boundary, using a quantum invariant called "3D index". The invariant is defined using an ideal…

Geometric Topology · Mathematics 2018-04-03 Dongmin Gang

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Computational Complexity · Computer Science 2016-06-09 Gabor Ivanyos , Miklos Santha