English
Related papers

Related papers: A Kronecker algorithm for locally closed sets over…

200 papers

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given…

Algebraic Geometry · Mathematics 2009-01-16 J. B. Lasserre , M. Laurent , P. Rostalski

A framework is developed to describe the Zariski topologies on the prime and primitive spectra of a quantum algebra $A$ in terms of the (known) topologies on strata of these spaces and maps between the collections of closed sets of…

Quantum Algebra · Mathematics 2013-11-04 K. A. Brown , K. R. Goodearl

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

Number Theory · Mathematics 2018-02-01 Lenny Fukshansky , Nikolay Moshchevitin

We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…

Symbolic Computation · Computer Science 2017-12-18 Ruben Becker , Michael Sagraloff

Let K be a field of characteristic zero. We describe an algorithm which requires a homogeneous polynomial F of degree three in K[x_0,x_1,x_2,x_3] and a zero A of F in P^3_K and ensures a linear pfaffian representation of V(F) with entries…

Algebraic Geometry · Mathematics 2014-02-05 Fabio Tanturri

We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…

Combinatorics · Mathematics 2017-01-03 Alberto Besana , Cristina Martinez

We address the question of finding algebraic properties that are respectively equivalent, for a morphism between algebraic varieties over an algebraically closed field of characteristic zero, to be an homeomorphism for the Zariski topology…

Algebraic Geometry · Mathematics 2022-11-16 François Bernard , Goulwen Fichou , Jean-Philippe Monnier , Ronan Quarez

Let Y and X denote C^k vector fields on a possibly noncompact surface with empty boundary, k >0. Say that Y tracks X if the dynamical system it generates locally permutes integral curves of X. Let K be a locally maximal compact set of…

Dynamical Systems · Mathematics 2015-06-09 Morris W. Hirsch

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

Combinatorics · Mathematics 2026-01-05 Ernesto Vallejo , Pedro David Sánchez Salazar

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Representation Theory · Mathematics 2019-06-05 Vladimir V Kornyak

We characterize the Zariski topologies over an algebraically closed field in terms of general dimension-theoretic properties. Some applications are given to complex manifold and to strongly minimal sets.

Algebraic Geometry · Mathematics 2016-09-06 Ehud Hrushovski , Boris Zilber

The decomposition or approximation of a linear operator on a matrix space as a sum of Kronecker products plays an important role in matrix equations and low-rank modeling. The approximation problem in Frobenius norm admits a well-known…

Optimization and Control · Mathematics 2023-12-08 Mareike Dressler , André Uschmajew , Venkat Chandrasekaran

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

Optimization and Control · Mathematics 2023-07-13 Maria-Luiza Vladarean , Nikita Doikov , Martin Jaggi , Nicolas Flammarion

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Computational Complexity · Computer Science 2025-03-05 Klara Nosan , Amaury Pouly , Sylvain Schmitz , Mahsa Shirmohammadi , James Worrell

This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…

Algebraic Geometry · Mathematics 2014-04-29 Sheng-Ming Ma

Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…

Algebraic Geometry · Mathematics 2007-05-23 Uli Walther

We study the completion of a group relative to a Zariski dense representation in a reductive algebraic group over a field $k$. The characteristic zero case was worked out previously by R. Hain; we extend his results to arbitrary…

K-Theory and Homology · Mathematics 2016-09-07 Kevin P. Knudson

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

Rings and Algebras · Mathematics 2007-05-23 K. R. Goodearl , E. S. Letzter

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

Number Theory · Mathematics 2012-04-23 Jens-Dietrich Bauch , Enric Nart , Hayden D. Stainsby

We prove a fast computable criterion that expresses non-flatness in terms of torsion: Let R be a regular algebra of finite type over a field K of characteristic zero and let F be a module finitely generated over an R-algebra of finite type.…

Commutative Algebra · Mathematics 2017-09-29 Janusz Adamus , Hadi Seyedinejad