Related papers: Rigid irregular connections on P^1
We provide an extension of the Gromov--Zimmer Embedding Theorem for Cartan geometries of [3] to tractor bundles carrying any invariant connection, including tractor connections and prolongation connections of first BGG operators for…
The Fourier restriction conjecture is a fundamental problem in harmonic analysis. In this paper, we investigate restriction estimates for degenerate higher codimensional quadratic surfaces and obtain sharp results for some types of…
Standard convolutions are prevalent in image processing and deep learning, but their fixed kernels limits adaptability. Several deformation strategies of the reference kernel grid have been proposed. Yet, they lack a unified theoretical…
The novel notion of rigid commutators is introduced to determine the sequence of the logarithms of the indices of a certain normalizer chain in the Sylow 2-subgroup of the symmetric group on 2^n letters. The terms of this sequence are…
In the present note we focus on conic line arrangements in the plane with quasihomogeneous ordinary singularities from the perspective of weak Ziegler pairs. The foundations of this article come from an active area of research devoted to…
A linear system of real quadratic forms defines a real projective variety. The real non-singular locus of this variety (more precisely of the underlying scheme) has a highly connected double cover as long as each non-zero form in the system…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
Many applications using large datasets require efficient methods for minimizing a proximable convex function subject to satisfying a set of linear constraints within a specified tolerance. For this task, we present a proximal projection…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
In this work, an approach to generate radial interfaces is presented. A radial network recursively obtained is used to implement discrete model rules designed originally for the investigation in flat substrates. In order to test the…
We present a rigorous Ewald summation formula to evaluate the electrostatic interactions in two-dimensionally periodic planar interfaces of three-dimensional systems. By rewriting the Fourier part of the summation formula of the original…
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
A result of Keel and McKernan states that a hypothetical counterexample to the F-conjecture must come from rigid curves on $\bar {M}_{0,n}$ that intersect the interior. We exhibit several ways of constructing rigid curves. In all our…
In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…
By using the notion of a rigid R-matrix in a monoidal category and the Reshetikhin--Turaev functor on the category of tangles, we review the definition of the associated invariant of long knots. In the framework of the monoidal categories…
We extend the monotonicity method for direct exact reconstruction of inclusions in the partial data Calder\'on problem, to the case of general anisotropic conductivities in any spatial dimension $d\geq 2$. From a local Neumann-to-Dirichlet…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…