Related papers: Computer-assisted proofs of "Kariya's theorem" wit…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
Using vertex algebra techniques, we determine a set of generators for the cohomology ring of the Hilbert schemes of points on an arbitrary smooth projective surface over the field of complex numbers.
We show how Cartesian method can be used in the proof of fundamental planimetric topics of the school course, such as introduction of trigonometric functions, equation of a line and similarity of triangles. This work also can be considered…
When computer codes are used for modeling complex physical systems, their unknown parameters are tuned by calibration techniques. A discrepancy function may be added to the computer code in order to capture its discrepancy with the real…
We use computer algebra to determine the Lie invariants of degree <= 12 in the free Lie algebra on two generators corresponding to the natural representation of the simple 3-dimensional Lie algebra sl(2,C). We then consider the free Lie…
This paper is devoted to demonstrate Kakeya's geometric proof of his theorem (1912), independently established earlier by Enestr\"om (1893). By calculating centers and radii of the interlacing circles of Kakeya's method, we prove Kakeya's…
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…
In the decade since 2010, successes in artificial intelligence have been at the forefront of computer science and technology, and vector space models have solidified a position at the forefront of artificial intelligence. At the same time,…
These lecture notes are intended to give a modest impulse to anyone willing to start or pursue a journey into the theory of Vertex Algebras by reading one of Kac's or Lepowsky-Li's books. Therefore, the primary goal is to provide required…
This paper addresses the use of experimental data for calibrating a computer model and improving its predictions of the underlying physical system. A global statistical approach is proposed in which the bias between the computer model and…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in…
Details for known solutions of some geometric and algebraic problems with the help of origami are presented: two theorems of Haga, the general cubic equation, especially the heptagon equation, doubling the cube as well as the trisection of…
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed on the variables.…
In this article using elementary school level Geometry we observe an alternative proof of Pythagorean Theorem from Heron's Formula.
Using class field theory one associates to each curve C over a finite field, and each subgroup G of its divisor class group, unramified abelian covers of C whose genus is determined by the index of G. By listing class groups of curves of…
A fundamental problem in computer vision is boundary estimation, where the goal is to delineate the boundary of objects in an image. In this paper, we propose a method which jointly incorporates geometric and topological information within…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…