Related papers: A package for computations with classical resultan…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

When attempting to understand the behavior of an executable, a binary analyst can make use of many different techniques. These include program slicing, dynamic instrumentation, binary-level rewriting, symbolic execution, and formal…

The R package walker extends standard Bayesian general linear models to the case where the effects of the explanatory variables can vary in time. This allows, for example, to model the effects of interventions such as changes in tax policy…

We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is…

In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…

We offer a Maple package {\tt Poincare\_Series} for calculating the Poincar\'e series for the algebras of invariants/covariants of binary forms, for the algebras of joint invariants/covariants of several binary forms, for the kernel of…

We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on…

We present FormTracer, a high-performance, general purpose, easy-to-use Mathematica tracing package which uses FORM. It supports arbitrary space and spinor dimensions as well as an arbitrary number of simple compact Lie groups. While…

We use the symmetric product to describe the resultant scheme and discriminant scheme of polynomials two variables.

We study $Q$-tableaux and axiom systems that they engender, producing a new proof that the Implicational Propositional Calculus is complete.

Resultants are getting increasingly important in modern theoretical physics: they appear whenever one deals with non-linear (polynomial) equations, with non-quadratic forms or with non-Gaussian integrals. Being a subject of more than…

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic…

We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…

Multivariate residues appear in many different contexts in theoretical physics and algebraic geometry. In theoretical physics, they for example give the proper definition of generalized-unitarity cuts, and they play a central role in the…

We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, nonreduced) projective scheme. For example, the algorithm yields the topological Euler characteristic…

The $M_2$ variables are devised to extend $M_{T2}$ by promoting transverse masses to Lorentz-invariant ones and making explicit use of on-shell mass relations. Unlike simple kinematic variables such as the invariant mass of visible…

This preprint contains a description of a package for Mathematica called EinS. This package allows one to perform various calculations with indexed objects.

Using discrete Morse theory, Batzies and Welker introduced Morse resolutions of monomial ideals. In this note, we present the {\it Macaulay2} package {\tt MorseResolutions} for working with two important classes of Morse resolutions:…

We introduce FunKit, a Mathematica package for the derivation and tracing of functional equations from arbitrary master equations. FunKit provides an expression vocabulary and a set of rules that allow for derivations in any given field…