Related papers: Recursive Triangles Appearing Embedded in Recursiv…
Additional remarks and questions for transseries. In particular: properties of composition for transseries; the recursive nature of the construction of R[[[ x ]]]; modes of convergence for transseries. There are, at this stage, questions…
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…
We give the connection between three polynomials that generate triangles in The On-Line Encyclopedia of Integer Sequences (A123192, A137396 and A300453). We show that they are related with the bracket polynomial for the (2,n)-torus knot
A formal sequent system dealing with Menelaus' configurations is introduced in this paper. The axiomatic sequents of the system stem from 2-cycles of Delta-complexes. The Euclidean and projective interpretations of the sequents are defined…
This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…
Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in $2$-colorings of the edges of the complete graph $K_n$ that deal with the appearance of unavoidable patterns once a…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.
An elliptic divisibility sequence is an integer recurrence sequence associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base…
In this paper we introduce the theory of ends and coends in the context of enriched bicategories. This will be an enriched version of the theory introduced in [Cor16], and a bicategorical version of the classical theory of enriched…
In this article, we give an unconditional definition of the motivic analogue of the intersection complex, establish its basic properties, and prove its existence in certain cases.
We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
We construct a converging geometric iterated function system on the moduli space of ordered triangles, for which the involved functions have geometric meanings and contain a non-contraction map under the natural metric.
We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…