Related papers: Linear sets from projection of Desarguesian spread…
Some sharp inequalities of Gruss type for sequences of vectors in real or complex normed linear spaces are obtained. Applications for the discrete Fourier and Mellin transform are given. Estimates for polynomials with coefficients in normed…
In this paper, we discuss a novel model reduction framework for generalized linear systems. The transfer functions of these systems are assumed to have a special structure, e.g., coming from second-order linear systems and time-delay…
The space ${\Bbb{L}}$ of oriented lines, or rays, in ${\Bbb{R}}^3$ is a 4-dimensional space with an abundance of natural geometric structure. In particular, it boasts a neutral K\"ahler metric which is closely related to the Euclidean…
We consider diffusion-controlled release of particles from $d$-dimensional radially-symmetric geometries. A quantity commonly used to characterise such diffusive processes is the proportion of particles remaining within the geometry over…
Given an embedding of a smooth projective curve $X$ of genus $g\geq1$ into $\mathbb{P}^N$, we study the locus of linear subspaces of $\mathbb{P}^N$ of codimension 2 such that projection from said subspace, composed with the embedding, gives…
A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…
Hypergraphs are a common model for multiway relationships in data, and hypergraph semi-supervised learning is the problem of assigning labels to all nodes in a hypergraph, given labels on just a few nodes. Diffusions and label spreading are…
We introduce the notion of Galois holomorphic foliation on the complex projective space as that of foliations whose Gauss map is a Galois covering when restricted to an appropriate Zariski open subset. First, we establish general criteria…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems. Numerous algorithms have been proposed for determining the projection; however, the primary focus of the literature has been…
We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…
In this paper we propose a semi-parametric Bayesian Generalized Least Squares estimator. In a generic setting where each error is a vector, the parametric Generalized Least Square estimator maintains the assumption that each error vector…
Mixed-parity module emerges for instance when a de Rham Galois representation is being tensored with a square root of cyclotomic character, which produces half odd integers as the corresponding Hodge-Tate weights. We build the whole…
A line field on a manifold is a smooth map which assigns a tangent line to all but a finite number of points of the manifold. As such, it can be seen as a generalization of vector fields. They model a number of geometric and physical…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
A previous article was devoted to an analysis of the symmetry properties of a class of first-order delay ordinary differential systems (DODSs). Here we concentrate on linear DODSs. They have infinite-dimensional Lie point symmetry groups…
A spatially varying blur kernel $h(\mathbf{x},\mathbf{u})$ is specified by an input coordinate $\mathbf{u} \in \mathbb{R}^2$ and an output coordinate $\mathbf{x} \in \mathbb{R}^2$. For computational efficiency, we sometimes write…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
This paper introduces a framework based on linear splines for 2-dimensional extended object tracking and classification. Unlike state of the art models, linear splines allow to represent extended objects whose contour is an arbitrarily…
We propose iterative projection methods for solving square or rectangular consistent linear systems Ax = b. Existing projection methods use sketching matrices (possibly randomized) to generate a sequence of small projected subproblems, but…