Related papers: A Note on Gram-Schmidt's Algorithm for a General A…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…
Let $\Gamma$ be a finite graph together with a group $G_v$ at each vertex $v$. The graph product $G(\Gamma)$ is obtained from the free product of all $G_v$ by factoring out by the normal subgroup generated by $\{g^{-1}h^{-1}gh; g\in G_v,…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
State and measurement tomography make assumptions about the experimental states or measurements. These assumptions are often not justified because state preparation and measurement errors are unavoidable in practice. Here we describe how…
Schmidt's subspace theorem in terms of Seshadri constants for closed subschemes in subgeneral position has been already developed sharply. We derive our theorem for numerically equivalent ample divisors by dint of the above theory step by…
We give necessary and sufficient conditions for a family of inner products in a finite-dimensional vector space $V$ over an arbitrary field $\mathbb{K}$ to have an orthogonal basis relative to all the inner products. Some applications to…
The Schur-Horn Theorem states that there exists a self-adjoint matrix with a given spectrum and diagonal if and only if the spectrum majorizes the diagonal. Though the original proof of this result was nonconstructive, several constructive…
Omnidirectional cameras are widely used in such areas as robotics and virtual reality as they provide a wide field of view. Their images are often processed with classical methods, which might unfortunately lead to non-optimal solutions as…
A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…
It is shown that gravitational lensing by point masses arranged in an infinitely extended regular lattice can be studied analytically using the Weierstrass functions. In particular, we draw the critical curves and the caustic networks for…
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous semi-conjugate gradient (SCG) method for unsymmetric positive definite linear systems.…
We consider the Grassman manifold $G(E)$ as the subset of all orthogonal projections of a given Euclidean space $E$ and obtain some explicit formulas concerning the differential geometry of $G(E)$ as a submanifold of $L(E,E)$ endowed with…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…