Related papers: Automated Proofs in Geometry : Computing Upper Bou…
We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…
This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…
We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…
The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural networks to solve multidimensional linear optimization problems,…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
In this paper, we derive $C^2$ estimates for a class of mixed Hessian type equations with Dirichlet boundary condition, and obtain the existence theorem of admissible solutions for the classical Dirichlet problem of these mixed Hessian type…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…
In this work, we consider the Dirichlet boundary value problem for nonlinear triharmonic equation. Due to the reduction of the nonlinear boundary value problem to operator equation for the nonlinear term and the unknown second normal…
We consider hyperbolic manifolds with boundary, which admit an ideal triangulation with n ideal triangles and one edge. We prove that the number of these manifolds is $\exp(n\ln(n)+O(n))$.
In this paper we apply various first and second derivative estimates and barrier constructions from our treatment of oblique boundary value problems for augmented Hessian equations, to the case of Dirichlet boundary conditions. As a result…
We present an algorithm for computing equations of canonically embedded Riemann surfaces with automorphisms. A variant of this algorithm with many heuristic improvements is used to produce equations of Riemann surfaces $X$ with large…
The results of computational experiments with ABS algorithms for overdetermined linear systems are reported.
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
An approach for the computation of upper bounds on the size of large complete arcs is presented. We obtain in particular geometrical properties of irreducible envelopes associated to a second largest complete arc provided that the order of…
We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…