Related papers: Syzygies among reduction operators
Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that consists of traversal strategies and insertion of contexts. We…
WE use the structure theory for C_0 operators to determine when the square of a C_0(1) operator is irreducible and when its lattices of invariant and hyperinvariant subspaces coincide.
Integration-by-parts reductions play a central role in perturbative QFT calculations. They allow the set of Feynman integrals contributing to a given observable to be reduced to a small set of basis integrals, and they moreover facilitate…
A reduction of a source distribution is a collection of smaller sized distributions that are collectively equivalent to the source distribution with respect to the property of decomposability. That is, an arbitrary language is decomposable…
A new representation -which is similar to the Bargmann representation- of the creation and annihilation operators is introduced, in which the operators act like "multiplication with" and like "derivation with respect to" a single real…
We present a new notion of decomposition of semialgebraic sets by introducing a mode of irreducibility based on arc-analytic functions. The result is a refinement of the decomposition of such sets with respect to the Zariski topology as…
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a…
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can…
In this paper we introduce generalized grand Morrey spaces in the framework of quasimetric measure spaces, in the spirit of the so-called grand Lebesgue spaces. We prove a kind of reduction lemma which is applicable to a variety of…
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for…
We investigate some new classes of operator algebras which we call semi-$\sigma$-finite subdiagonal and Riesz approximable. These constitute the most general setting to date for a noncommutative Hardy space theory based on Arveson's…
We present an $m$-adic Newton iteration with quadratic convergence for lexicographic Gr\"obner basis of zero dimensional ideals in two variables. We rely on a structural result about the syzygies in such a basis due to Conca and Valla, that…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
We introduce the notions of multi-suprema and multi-infima for vector spaces equipped with a collection of wedges, generalizing the notions of suprema and infima in ordered vector spaces. Multi-lattices are vector spaces closed under…
Given a renormalizable theory we construct the dilatation operator, in the sense of generator of RG flow of composite operators. The generator is found as a differential operator acting on the space of normal symbols of composite operators…
Reduction-based interpreters are traditionally defined in terms of a one-step reduction function which systematically decomposes a term into a potential redex and context, contracts the redex, and recomposes it to construct the new term to…
In the context of general rough sets, the act of combining two things to form another is not straightforward. The situation is similar for other theories that concern uncertainty and vagueness. Such acts can be endowed with additional…
Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
A presentation by generators and relations of the $n$th symmetric power $B$ of a commutative algebra $A$ over a field of characteristic zero or greater than $n$ is given. This is applied to get information on a minimal homogeneous…