Related papers: On FGLM Algorithms with Tate Algebras
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…
In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
The earlier approach is used for description of qubits and geometric phase parameters, the things critical in the area of topological quantum computing. The used tool, Geometric (Clifford) Algebra is the most convenient formalism for that…
Recent advances in solving ordinary differential equations (ODEs) with neural networks have been remarkable. Neural networks excel at serving as trial functions and approximating solutions within functional spaces, aided by gradient…
Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
We establish results about algebraic shifting of simplicial complexes and use them to compare different shifting operations. In particular, we show that each shifting operation does not decrease the number of facets, and that the exterior…
The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets. However, extending…
Let $F$ be a number field. These notes explore Galois-theoretic, automorphic, and motivic analogues and refinements of Tate's basic result that continuous projective representations $Gal(\bar{F}/F) \to PGL_n(C)$ lift to $GL_n(C)$. We take…
We give a polynomial time reduction from vector scheduling problem (VS) to generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online…
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…