Related papers: A Generic Framework for Diamond Lemmas
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join, the spectra of the H-generalized join and the spectra of the generalized…
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
In a previous paper, we presented an infinite dimensional associative diagram algebra that satisfies the relations of the generalized Temperley--Lieb algebra having a basis indexed by the fully commutative elements of the Coxeter group of…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…
Frame bundles equipped with a principal connection have their local structure characterised by a 1-form, called the Cartan connection 1-form, which gathers the principal connection form and the soldering form. We introduce generalised frame…
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geometric manifestations of the same topological phenomena. In…
The Fundamental Theorem of Algebra can be thought of as a statement about the real numbers as a space, considered as an algebraic set over the real numbers as a field. This paper introduces what it means for an algebraic set or affine…
In this paper we provide a general tool to prove the consistency of $I1(\lambda)$ with various combinatorial properties at $\lambda$ typical at settings with $2^\lambda>\lambda^+$, that does not need a profound knowledge of the forcing…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs. In…
Motivated by problems on the \'etale cohomology of Rapoport--Zink spaces and their generalizations, as well as Fargues's geometrization conjecture for the local Langlands correspondence, we develop a six functor formalism for the \'etale…
A differential algebra of nonlinear generalized functions is presented as a tool for a wide range of nonsmooth nonlinear problems. The power of the differential algebra is used to do mathematical calculations or proofs; then the final…
The fundamental germ is a generalization of $\pi_{1}$, first defined for laminations which arise through group actions in math.DG/0506270. In this paper, the fundamental germ is extended to any lamination having a dense leaf admitting a…
In the context of large cardinals, the classical diamond principle Diamond_kappa is easily strengthened in natural ways. When kappa is a measurable cardinal, for example, one might ask that a Diamond_kappa sequence anticipate every subset…
The use of a reference element on which a finite element basis is constructed once and mapped to each cell in a mesh greatly expedites the structure and efficiency of finite element codes. However, many famous finite elements such as…
Even though quantum information theory gives advantage over classical information theory, these two information theories have a structural similarity that many exponet rates of information tasks asymptotically equal to entropic quantities.…