Related papers: From order one catalytic decompositions to context…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…
This paper is the first in a sequence on the structure of sets of solutions to systems of equations over a free associative algebra. We start by constructing a Makanin-Razborov diagram that encodes all the homogeneous solutions to a…
We investigate in detail relationships between the set ${\mathfrak B}^\infty$ of all infinite ``biconvex'' sets in the positive root system $\Delta_+$ of an arbitrary untwisted affine Lie algebra ${\mathfrak g}$ and the set ${\mathcal…
We explain how to obtain the set of solutions of a multivariate polynomial equation modulo a power of a prime number. These solutions are determined by a tree, called the trunk, which makes it possible to reconstruct all solutions. We apply…
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized…
The systematic method for the conversion of first class constraints to the equivalent set of Abelian one based on the Dirac equivalence transformation is developed. The representation for the corresponding matrix performing this…
The concept of a composed product for univariate polynomials has been explored extensively by Brawley, Brown, Carlitz, Gao, Mills, et al. Starting with these fundamental ideas and utilizing fractional power series representation (in…
We address the enumeration of Eulerian orientations of 4-valent planar maps according to three parameters: the number of vertices, the number of alternating vertices (having in/out/in/out incident edges), and the number of clockwise…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this…
We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…
We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
We describe how multirefence dynamic correlation theories can be naturally obtained as single-reference correlation theories in a canonically transformed frame. Such canonically transformed correlation theories are very simple and involve…