Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Computation of the Topology of a Non-Reduced Implicit Space Curve
238
0
0.0
(
0
)
Added by
Olivier Ruatta
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Authors
Daouda Niang Diatta
Ask ChatGPT about the research
No Arabic abstract
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve. The algorithm is designed to provide the exact result for all inputs. Its a symbolic-numeric algorithm based on subresultant computation. Simple algebraic criteria are given to certify the output of the algorithm. The algorithm uses only one projection of the non-reduced space curve augmented with adjacency information around some particular points of the space curve. The algorithm is implemented with the Mathemagix Computer Algebra System (CAS) using the SYNAPS library as a backend.
rate research
Read More
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra setting. Helical curves, where curvature and torsion are proportional, need to be distinguished as a special case. The algorithm is easy to implement, as it involves only standard computer algebra techniques, such as greatest common divisors and resultants, and Grobner basis for the special case of helical curves. Details on the implementation and experimentation carried out using the computer algebra system Maple 18 are provided.
The learnability of different neural architectures can be characterized directly by computable measures of data complexity. In this paper, we reframe the problem of architecture selection as understanding how data determines the most expressive and generalizable architectures suited to that data, beyond inductive bias. After suggesting algebraic topology as a measure for data complexity, we show that the power of a network to express the topological complexity of a dataset in its decision region is a strictly limiting factor in its ability to generalize. We then provide the first empirical characterization of the topological capacity of neural networks. Our empirical analysis shows that at every level of dataset complexity, neural networks exhibit topological phase transitions. This observation allowed us to connect existing theory to empirically driven conjectures on the choice of architectures for fully-connected neural networks.
For a wide class of Cohen--Macaulay modules over the local ring of the plane curve singularity of type T_44 we explicitly describe the corresponding matrix factorizations. The calculations are based on the technique of matrix problems, in particular, representations of bunches of chains.
The paper has two goals: the study the associated graded ring of contracted homogeneous ideals in $K[x,y]$ and the study of the Groebner fan of the ideal $P$ of the rational normal curve in ${bf P}^d$. These two problems are, quite surprisingly, very tightly related. We completely classify the contracted ideals with a Cohen-Macaulay associated graded rings in terms of the numerical invariants arising from Zariskis factorization. We determine explicitly all the initial ideals (monomial or not) of $P$ that are Cohen-Macaulay.
The Serpinsky-Knopp curve is characterized as the only curve (up to isometry) that maps a unit segment onto a triangle of a unit area, so for any pair of points in the segment, the square of the distance between their images does not exceed four times the distance between them.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
