Related papers: Bott periodicity in the Hit Problem
In this work we develop new finite element discretisations of the shear-deformable Reissner--Mindlin plate problem based on the Hellinger-Reissner principle of symmetric stresses. Specifically, we use conforming Hu-Zhang elements to…
We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$. Using a new separator theorem, we show that unit ball graphs in $\mathbb{H}^d$…
Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…
In this paper, we study the dynamics of a class of nonlinear Schr\"odinger equation $ i u_t = \triangle u + u^p $ for $ x \in \mathbb{T}^d$. We prove that the PDE is integrable on the space of non-negative Fourier coefficients, in…
We prove an extension results for the multiplier of an attracting periodic orbit of a quadratic map as a function of the parameter. This has applications to the problem of geometry of the Mandelbrot and Julia sets. In particular, we prove…
We describe a relation between the invariants of $n$ ordered points in $P^d$ and of points contained in a union of linear subspaces $P^{d1}\cup P^{d2} \subset P^d$. This yields an attaching map for GIT quotients parameterizing point…
We consider the Cauchy problem for the Gross-Pitaevskii (GP) equation. Using the DBAR generalization of the nonlinear steepest descent method of Deift and Zhou we derive the leading order approximation to the solution of the GP in the…
Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…
We present a high-order accurate boundary-based solver for three-dimensional (3D) frequency-domain scattering from a doubly-periodic grating of smooth axisymmetric sound-hard or transmission obstacles. We build the one-obstacle solution…
Scattering by (a) a single composite scatterer consisting of a concentric arrangement of an outer N-slit rigid cylinder and an inner cylinder which is either rigid or in the form of a thin elastic shell and (b) by a finite periodic array of…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum $s$-$t$ cut, the minimum multiway cut, and the minimum $k$-way cut are some of the commonly…
Periodic surface structures are nowadays standard building blocks of optical devices. If such structures are illuminated by aperiodic time-harmonic incident waves as, e.g., Gaussian beams, the resulting surface scattering problem must be…
Cutwidth is a widely studied parameter that quantifies how well a graph can be decomposed along small edge-cuts. It complements pathwidth, which captures decomposition by small vertex separators, and it is well-known that cutwidth…
We study the properties of classical vortex solutions in a non-Abelian gauge theory. A system of two adjoint Higgs fields breaks the SU(2) gauge symmetry to $Z_2$, producing 't Hooft-Polyakov monopoles trapped on cosmic strings, termed…
We consider the inverse scattering problem to reconstruct a local perturbation of a given inhomogeneous periodic layer in $\mathbb{R}^d$, $d=2,3$, using near field measurements of the scattered wave on an open set of the boundary above the…
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line…
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…
We investigate some aspects of the geometry of two classical generalisations of the Hilbert schemes of points. Precisely, we show that parity conjecture for $\text{Quot}_r^d\mathbb{A}^3$ already fails for $d=8$ and $r=2$ and that lots of…