English
Related papers

Related papers: Effective difference elimination and Nullstellensa…

200 papers

Difference equations have many applications and play an important role in numerical analysis, probability, statistics, combinatorics, computer science, quantum consciousness, etc. We first prove that the partial differential equation is…

Analysis of PDEs · Mathematics 2025-02-24 Chun-Kai Hwang , Tzon-Tzer Lu

Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…

Rings and Algebras · Mathematics 2018-04-27 Igor Klep , Victor Vinnikov , Jurij Volčič

We introduce and investigate a category-theoretic abstraction of the standard "system-solution" adjunction in affine algebraic geometry. We then look further into these geometric adjunctions at different levels of generality, from syntactic…

Category Theory · Mathematics 2018-03-14 Olivia Caramello , Vincenzo Marra , Luca Spada

We continue the program initiated in a previous work, of applying integro-differential methods to Neumann Homogenization problems. We target the case of linear periodic equations with a singular drift, which includes (with some regularity…

Analysis of PDEs · Mathematics 2019-10-07 Nestor Guillen , Russell W. Schwab

Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…

Artificial Intelligence · Computer Science 2009-09-18 George Katsirelos , Toby Walsh

We introduce a notion of dimension for the solution set of a system of algebraic difference equations that measures the degrees of freedom when determining a solution in the ring of sequences. This number need not be an integer, but, as we…

Algebraic Geometry · Mathematics 2020-11-23 Michael Wibmer

We derive two consequences of the multivariate fundamental theorem of algebra (MFTA). The first one is the Bezout theorem for $n$ polynomials. Notably the intersection multiplicities, as in MFTA, are characterized just by means of partial…

Algebraic Geometry · Mathematics 2007-05-23 H. Hakopian

We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…

Classical Analysis and ODEs · Mathematics 2014-12-12 Alberto Cabada , José Ángel Cid , Gennaro Infante

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

A procedure for obtaining a "minimal" discretization of a partial differential equation, preserving all of its Lie point symmetries is presented. "Minimal" in this case means that the differential equation is replaced by a partial…

Mathematical Physics · Physics 2009-11-11 Francis Valiquette , Pavel Winternitz

We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…

Number Theory · Mathematics 2011-08-25 Giovanni Coppola

We study systems of $n \geq 1$ discrete differential equations of order $k\geq1$ in one catalytic variable and provide a constructive and elementary proof of algebraicity of their solutions. This yields effective bounds and a systematic…

Combinatorics · Mathematics 2023-03-15 Hadrien Notarantonio , Sergey Yurkevich

A ring with an Auslander dualizing complex is a generalization of an Auslander-Gorenstein ring. We show that many results which hold for Auslander-Gorenstein rings also hold in the more general setting. On the other hand we give criteria…

Rings and Algebras · Mathematics 2007-05-23 Amnon Yekutieli , James J. Zhang

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

Symbolic Computation · Computer Science 2023-06-12 Pierre Lairez , Tristan Vaccon

Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…

Logic · Mathematics 2025-06-17 Yong Cheng

Existing approaches to depth or disparity estimation output a distribution over a set of pre-defined discrete values. This leads to inaccurate results when the true depth or disparity does not match any of these values. The fact that this…

Computer Vision and Pattern Recognition · Computer Science 2021-03-30 Divyansh Garg , Yan Wang , Bharath Hariharan , Mark Campbell , Kilian Q. Weinberger , Wei-Lun Chao

An inverse problem of finding an obstacle and the boundary condition on its surface from the fixed-energy scattering data is studied. A new method is developed for a proof of the uniqueness results. The method does not use the discreteness…

Mathematical Physics · Physics 2007-05-23 A. G. Ramm

We prove an Ax-Lindemann-Weierstrass differential transcendence result for Euler's gamma function, namely that the functions $\Gamma(\nu-\zeta_1(\nu)),\dots,\Gamma(\nu-\zeta_n(\nu))$ are differentially independent over the field of rational…

Number Theory · Mathematics 2025-09-01 Lucia Di Vizio , Federico Pellarin

The article discusses the gradient discretisation method (GDM) for distributed optimal control problems governed by diffusion equation with pure Neumann boundary condition. Using the GDM framework enables to develop an analysis that…

Numerical Analysis · Mathematics 2018-10-09 Jerome Droniou , Neela Nataraj , Devika Shylaja

This paper describes a new alignment algorithm for sequences that can be used for determination of deletions and substitutions. It provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or…

Information Theory · Computer Science 2012-11-01 Sandeep Hosangadi , Subhash Kak
‹ Prev 1 3 4 5 6 7 10 Next ›