Related papers: Computing with Hypergeometric-Type Terms
In the last few years there has been a growing interest towards methods for statistical inference and learning based on computational geometry and, notably, tropical geometry, that is, the study of algebraic varieties over the min-plus…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind:…
Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations,…
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…
In the first part of the paper we construct a ring structure on the rational cobordism classes of Morin maps (i. e. smooth generic maps of corank 1). We show that associating to a Morin map its singular strata defines a ring homomorphism to…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Hypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world. For example, when modeling collaboration networks, which may involve not just two but…
Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…
We undertake to develop a successful framework for commutative-associative hypercomplex numbers with the view to explicate and study associated geometric and generalized-relativistic concepts, basing on an interesting possibility to…
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…
Hypergeometric structures in single and multiscale Feynman integrals emerge in a wide class of topologies. Using integration-by-parts relations, associated master or scalar integrals have to be calculated. For this purpose it appears useful…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP…
The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…
We undertake the study of bivariate Horn systems for generic parameters. We prove that these hypergeometric systems are holonomic, and we provide an explicit formula for their holonomic rank as well as bases of their spaces of complex…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
Using the language of finite element exterior calculus, we define two families of $H^1$-conforming finite element spaces over pyramids with a parallelogram base. The first family has matching polynomial traces with tensor product elements…