Related papers: Rigid irregular connections on P^1
We study how the properties of irreducibility and rigidity in digital images interact with Cartesian products, wedges, and cold and freezing sets.
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
In this paper we study the bounded perturbation resilience of projection and contraction algorithms for solving variational inequality (VI) problems in real Hilbert spaces. Under typical and standard assumptions of monotonicity and…
Many tight frames of interest are constructed via their Gramian matrix (which determines the frame up to unitary equivalence). Given such a Gramian, it can be determined whether or not the tight frame is projective group frame, i.e., is the…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
In this paper we give a review on the computational methods used to characterize the complex singularities developed by some relevant PDEs. We begin by reviewing the singularity tracking method based on the analysis of the Fourier spectrum.…
The randomized extended Kaczmarz and Gauss-Seidel algorithms have attracted much attention because of their ability to treat all types of linear systems (consistent or inconsistent, full rank or rank-deficient). In this paper, we interpret…
This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…
We prove a Calder\'on-Zygmund type estimate which can be applied to sharpen known regularity results on spherical means, Fourier integral operators and generalized Radon transforms.
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
We study orientifold projections of families of four-dimensional $\mathcal{N}=1$ toric quiver gauge theories. We restrict to quivers that have the unusual property of being associated with multiple periodic planar diagrams which give rise,…
This paper describes a trapezoidal quadrature method for the discretization of weakly singular, singular and hypersingular boundary integral operators with complex symmetric quadratic forms. Such integral operators naturally arise when…
Analytic methods are emerging in solid and configuration modeling, while providing new insights into a variety of shape and motion related problems by exploiting tools from group morphology, convolution algebras, and harmonic analysis.…
To a regular projection of a knot we associate a finite dimensional non-commutative associative algebra which is self-injective and special biserial.
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
The linear finite irreducible representations of the algebra of the 1D $N$-Extended Supersymmetric Quantum Mechanics are discussed in terms of their "connectivity" (a symbol encoding information on the graphs associated to the irreps). The…
We introduce a geometric realization of noncommutative singularity resolutions. To do this, we first present a new conjectural method of obtaining conventional resolutions using coordinate rings of matrix-valued functions. We verify this…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
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 develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…