Related papers: On the parallel lines for nondegenerate conics
Boix, De Stefani and Vanzo have characterized ordinary/supersingular elliptic curves over $\mathbb{F}_p$ in terms of the level of the defining cubic homogenous polynomial. We extend their study to arbitrary genus, in particular we prove…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
Affine geometry is usually regarded as a framework in which metric notions such as distance and angle are absent. However, just as projective geometry produces various metric geometries by introducing additional structures on the line at…
We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…
The diagonal in a product of projective spaces is cut out by the ideal of 2x2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
We establish $L^2$ boundedness of all "nice" parabolic singular integrals on "Good Parabolic Graphs", aka {\em regular} Lip(1,1/2) graphs. The novelty here is that we include non-homogeneous kernels, which are relevant to the theory of…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…
Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been…
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…
We show that an orthogonal basis for a finite-dimensional Hilbert space can be equivalently characterised as a commutative dagger-Frobenius monoid in the category FdHilb, which has finite-dimensional Hilbert spaces as objects and continuous…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
The work examines norms in of fundamental trigonometric splines of odd and even degrees, which in some cases coincide with polynomial ones. Fundamental trigonometric splines for the case where the con-vergence factors depend on the…
In this paper, we study the solving degrees for affine semi-regular sequences and their homogenized sequences. Some of our results are considered to give mathematically rigorous proofs of the correctness of methods for computing Gr\"{o}bner…