Related papers: Integer formula encoding SageTeX package
Elementary tutorial on implementation aspects of Gr\"obner bases computation.
We describe here a rudimentary sage implementation of the Bhattacharya-Mesner hypermatrix algebra package.
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
In mathematics, LaTeX is the de facto standard to prepare documents, e.g., scientific publications. While some formulae are still developed using pen and paper, more complicated mathematical expressions used more and more often with…
We present a new procedure to infer size bounds for integer programs automatically. Size bounds are important for the deduction of bounds on the runtime complexity or in general, for the resource analysis of programs. We show that our…
This preprint contains a description of a package for Mathematica called EinS. This package allows one to perform various calculations with indexed objects.
Mathematical documents written in LaTeX often contain ambiguities. We can resolve some of them via semantic markup using, e.g., sTeX, which also has other potential benefits, such as interoperability with computer algebra systems, proof…
We propose several procedures for creating new families of integer sequences based on the method of Cantor diagonalization. Then we modify and generalize this method. The paper includes explicit formulas for most proposed families of…
We have developed a Mathematica package capable of performing gamma-matrix algebra in arbitrary (integer) dimensions. As an application we can compute Fierz transformations.
LaTeX is a free document preparation system that handles the typesetting of mathematical expressions smoothly and elegantly. It has become the standard format for creating and publishing research articles in mathematics and many scientific…
Over the years, integer linear programs have been employed to model inference in many natural language processing problems. This survey is meant to guide the reader through the process of framing a new inference problem as an instance of an…
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a wide range of combinatorial theories, can numerically…
Despite the wide variety of input types in machine learning, this diversity is often not fully reflected in their representations or model architectures, leading to inefficiencies throughout a model's lifecycle. This paper introduces an…
We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC,…
Embedding words in high-dimensional vector spaces has proven valuable in many natural language applications. In this work, we investigate whether similarly-trained embeddings of integers can capture concepts that are useful for mathematical…
Mathematical notation makes up a large portion of STEM literature, yet finding semantic representations for formulae remains a challenging problem. Because mathematical notation is precise, and its meaning changes significantly with small…
Mathematical formulae represent complex semantic information in a concise form. Especially in Science, Technology, Engineering, and Mathematics, mathematical formulae are crucial to communicate information, e.g., in scientific papers, and…
We present an implementation of algorithms for the symbolic integration of hyperlogarithms multiplied by rational functions in the computer algebra system FORM. This implementation encompasses cases where hyperlogarithms have rational…
We present an elliptic version of Selberg's integral formula.
Distributions on integers are ubiquitous in probabilistic modeling but remain challenging for many of today's probabilistic programming languages (PPLs). The core challenge comes from discrete structure: many of today's PPL inference…