Related papers: Implicitization using approximation complexes
We review classical approaches to the problem of isometrically embedding a Riemannian surface into Euclidean 3-space, including coordinate-based approaches exposited by Darboux and Eisenhart, as well as the moving-frames based approaches…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
The purpose of this work is to study an approximation to an abstract Bessel-type problem, which is a generalization of the extension problem associated with fractional powers of the Laplace operator. Motivated by the success of such…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
Recently, Chach\'olski, Neeman, Pitsch, and Scherer studied, in a series of three papers, model approximations for the unbounded category of cochain complexes over a commutative ring. These approximations allow to construct relative…
The approach to curve implicitization through Sylvester and Bezout resultant matrices and bivariate interpolation in the usual power basis is extended to the case of Bernstein-Bezoutian matrices constructed when the polynomials are given in…
Solving Bayesian inverse problems typically involves deriving a posterior distribution using Bayes' rule, followed by sampling from this posterior for analysis. Sampling methods, such as general-purpose Markov chain Monte Carlo (MCMC), are…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
The main purpose of this book is to propose an introduction to the modern tools of algebraic complexity. To remain as simple as possible while providing meaningful examples, we chose to focus on effective linear algebra; this is certainly…
This article presents a class of modified new modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). By using two positive diagonal matrices, we formulate a fixed-point equation which is…
Autoformalization has emerged as a term referring to the automation of formalization - specifically, the formalization of mathematics using interactive theorem provers (proof assistants). Its rapid development has been driven by progress in…
We develop in this paper some methods for studying the implicitization problem for a rational map $\phi: \mathbb{P}^n \to (\mathbb{P}^1)^{n+1}$ defining a hypersurface in $(\mathbb{P}^1)^{n+1}$, based on computing the determinant of a…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…
Mixed Boolean-Arithmetic (MBA) expressions are frequently used for obfuscation. As they combine arithmetic as well as Boolean operations, neither arithmetic laws nor transformation rules for logical formulas can be applied to suitably…
We propose an arbitrarily higher (even) order implicit leapfrog scheme for time discretization of a three-field formulation of Maxwell's equations. We use this in conjunction with an arbitrarily higher-order and compatible discretization…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
Implicit discourse relation classification is one of the most difficult steps in discourse parsing. The difficulty stems from the fact that the coherence relation must be inferred based on the content of the discourse relational arguments.…
The coalgebra approach to the construction of classical integrable systems from Poisson coalgebras is reviewed, and the essential role played by symplectic realizations in this framework is emphasized. Many examples of Hamiltonians with…
In this paper we further develop the theory of geometric tropicalization due to Hacking, Keel and Tevelev and we describe tropical methods for implicitization of surfaces. More precisely, we enrich this theory with a combinatorial formula…