Related papers: Cancellation Meadows: a Generic Basis Theorem and …
For even dimensional manifolds, we prove some twisted anomaly cancellation formulas which generalize some well-known cancellation formulas. For odd dimensional manifolds, we obtain some modularly invariant characteristic forms by the…
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by…
This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for the program and a given query. A general property of…
Field redefinitions are commonly used to reduce the number of operators in the Lagrangian by removing redundant operators and transforming to a minimal operator basis. We give a general argument that such field redefinitions, while leaving…
In [5], [6] and [8], the authors gave some modular forms over $\Gamma^0(2)$. In this note, we proceed with the study of cancellation formulas relating to the modular forms.
The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining…
In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…
We establish a new, fairly general cancellativity criterion for a presented monoid that properly extends the previously known related criteria. It is based on a new version of the word transformation called factor reversing, and its…
We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…
We introduce a notion of Q-algebra that can be considered as a generalization of the notion of Q-manifold (a supermanifold equipped with an odd vector field obeying {Q,Q} =0). We develop the theory of connections on modules over Q-algebras…
Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and…
Our aim is to construct fibrewise localizations in model categories. For pointed spaces, the general idea is to decompose the total space of a fibration as a diagram over the category of simplices of the base and replace it by the localized…
Let ${\bf G}$ be a connected reductive algebraic group defined over the finite field $\mathbb{F}_q$ with $q$ elements,where $q$ is a power of a prime number $p$. Let $\Bbbk$ be a field and we study the extensions of certain $\bk\bg$-modules…
We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former…
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant…
The study of non-supersymmetric string theories is shedding light on an important corner of the string landscape and might ultimately explain why, so far, we did not observe supersymmetry in our universe. We review how misaligned…
We study some consequences of dimensionally reducing systems with massless fermions and Abelian gauge fields from 3+1 to 2+1 dimensions. We first consider fermions in the presence of an external Abelian gauge field. In the reduced theory,…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We transfer distances on clusterings to the building process of decision trees, and as a consequence extend the classical ID3 algorithm to perform modifications based on the global distance of the tree to the ground truth--instead of…
Whitney's broken circuit theorem gives a graphical example to reduce the number of the terms in the sum of the inclusion-exclusion formula by a predicted cancellation. So far, the known cancellations for the formula strongly depend on the…