Related papers: An algebraic framework for geometrically continuou…
We derive an explicit formula, valid for all integers $r,d\ge 0$, for the dimension of the vector space $C^r_d(\Delta)$ of piecewise polynomial functions continuously differentiable to order $r$ and whose constituents have degree at most…
The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…
We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…
We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…
For a d-dimensional polyhedral complex P, the dimension of the space of piecewise polynomial functions (splines) on P of smoothness r and degree k is given, for k sufficiently large, by a polynomial f(P,r,k) of degree d. When d=2 and P is…
Partitioning sparse matrices and graphs is a common and important problem in many scientific and graph analytics applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as…
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…
Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…
Piecewise smooth systems are intensively studied today in many application areas, such as economics, finance, engineering, biology, and ecology. In this work, we consider a class of one-dimensional piecewise linear discontinuous maps with a…
We present a framework to systematically address topological phases when finer partitionings of bands are taken into account, rather than only considering the two subspaces spanned by valence and conduction bands. Focusing on…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…
Computing the envelope of deforming planar domains is a significant and challenging problem with a wide range of potential applications. We approximate the envelope using circular arc splines, curves that balance geometric flexibility and…
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic…
Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of…
Geodesic tracking on the projective line bundle $\R^2 \times P^1 $ has many uses, including the segmentation of objects in images. However, global tracking requires expensive distance map computations. We provide a practical solution to…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
The integration of Symmetric Positive Definite (SPD) matrices into deep learning has historically relied on fixed algebraic Riemannian metrics. Analogous to hand-crafted features in classical machine learning, these static formulations…
A function that is analytic on a domain of $\mathbb{C}^n$ is holonomic if it is the solution to a holonomic system of linear homogeneous differential equations with polynomial coefficients. We define and study the Bernstein-Sato polynomial…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…