Related papers: Rigid irregular connections on P^1
This paper explores a new class of constrained difference programming problems, where the objective and constraints are formulated as differences of functions, without requiring their convexity. To investigate such problems, novel variants…
We present a proximal augmented Lagrangian based solver for general convex quadratic programs (QPs), relying on semismooth Newton iterations with exact line search to solve the inner subproblems. The exact line search reduces in this case…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
Using the Fourier-Laplace transform, we describe the isomonodromy equations for meromorphic connections on the Riemann sphere with unramified irregular singularities as those for connections with a (possibly ramified) irregular singularity…
A recently proposed definition of a linear connection in non-commutative geometry, based on a generalized permutation, is used to construct linear connections on GL_q(n). Restrictions on the generalized permutation arising from the…
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…
A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…
A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We…
We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
In this paper, we proved two results regarding the arithmetics of separably $\mathbb{A}^1$-connected varieties of rank one. First we proved over a large field, there is an $\mathbb{A}^1$-curve through any rational point of the boundary, if…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We consider the problem of analyzing and designing gradient-based discrete-time optimization algorithms for a class of unconstrained optimization problems having strongly convex objective functions with Lipschitz continuous gradient. By…
We reconsider the sub-leading quantum perturbative corrections to N=2 cubic special Kaehler geometries. Imposing the invariance under axion-shifts, all such corrections (but the imaginary constant one) can be introduced or removed through…
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the p norm of the vector of…
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…
For the reconstruction problem, the universal representation of inverse Radon transforms implies the needed complexity of the direct Radon transforms which leads to the additional contributions. In the standard theory of generalized…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
We overview some of the foundations of the so-called henselian rigid geometry, and show that henselian rigid geometry has many aspects, useful in applications, that one cannot expect in the usual rigid geometry. This is done by announcing a…