相关论文: Several Applications of Bezout Matrices

Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…

This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…

Scaling problems have a rich and diverse history, and thereby have found numerous applications in several fields of science and engineering. For instance, the matrix scaling problem has had applications ranging from theoretical computer…

Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are omnipresent in modern computation. The four classes have distinct features, but in 1990 we showed that Vandermonde and Hankel multipliers transform all these…

Embeddings are a fundamental component of many modern machine learning and natural language processing models. Understanding them and visualizing them is essential for gathering insights about the information they capture and the behavior…

Measuring comodules are defined and shown to provide a useful generalization of the set of maps between modules with a broad range of applications. Three applications are described. Connections on bundles are described in terms of measuring…

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

In this paper, we give an elementary new method for determining the rational points on algebraic curves using torsion packets. We also provide examples of curves for which all rational points can be completely determined by our method.

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…

A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…

In this work, we develop a framework based on piecewize B\'ezier curves to plane shapes deformation and we apply it to shape optimization problems. We describe a general setting and some general result to reduce the study of a shape…

Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…

We study the theory of diagonal reductions of matrices over simple Ore domains of finite stable range. We cover the cases of 2-simple rings of stable range 1, Ore domains and certain cases of Bezout domains.

Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…

We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…

We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…

We explore elementary matrix reduction over certain rings characterized by their localizations. Let $R$ be a locally stable ring, we prove that $R$ is an elementary divisor ring if and only if $R$ is a Bezout ring. Elementary matrix…