Related papers: Further Comments on Yablo's Construction
Applying Baaz's Generalization Method and a new technique to, respectively, proofs and denumerable simple graphs, diverse arithmetical patterns are observed. In particular, sufficient conditions for a number to be a divisor of a Fermat…
When the inverse of an algorithm is well-defined -- that is, when its output can be deterministically transformed into the input producing it -- we say that the algorithm is invertible. While one can describe an invertible algorithm using a…
We outline some recent proofs of quantum ergodicity on large graphs and give new applications in the context of irregular graphs. We also discuss some remaining questions.
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…
A well known theorem of Lagrange states that the simple continued fraction of a real number $\alpha$ is periodic if and only if $\alpha$ is a quadratic irrational. We examine non-periodic and non-simple continued fractions formed by two…
Recent progress in large language models has renewed interest in how multi-step reasoning is represented internally. While prior work often treats reasoning as a linear chain, many reasoning problems are more naturally modeled as directed…
We define a higher analogue of Dirac structures on a manifold M. Under a regularity assumption, higher Dirac structures can be described by a foliation and a (not necessarily closed, non-unique) differential form on M, and are equivalent to…
In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…
We introduce the continued logarithm representation of real numbers and prove results on the occurrence and frequency of digits with respect to this representation
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…
We study some problems related to lazy 2-cocycles, such as: extension of (lazy) 2-cocycles to a Drinfeld double and to a Radford biproduct, Yetter-Drinfeld data obtained from lazy 2-cocycles, lifting of projective representations afforded…
In this paper, we study the possible bifurcations of periodic orbits by reducing them to graphs. The aforementioned allows to study the genericity of routes to chaos, as well as to analyze their possible complexity. In particular, our…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.
We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.
We show a method of describing processes with indefinite causal order (ICO) by a definite causal order. We do so by relabeling the processes that take place in the circuit in accordance with the basis of measurement of control qubit. Causal…
L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…
We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic $(n_3)$ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability.…