相关论文: Correspondence and translation principles for the …
This paper proposes a mechanism for learning pattern correspondences between two languages from a corpus of translated sentence pairs. The proposed mechanism uses analogical reasoning between two translations. Given a pair of translations,…
We prove the decoration theorem for the Mandelbrot set (and Multibrot sets) which says that when a "little Mandelbrot set" is removed from the Mandelbrot set, then most of the resulting connected components have small diameters.
Following the ideas of A.~Douady, we give an alternative proof of the authors' result: for any boundary point $c_0$ of the Mandelbrot set $M$, we can find small quasiconformal copies of $M$ in $M$ that are encaged in nested quasiconformal…
We begin with recalling the correspond theorem of induced modules and global sections of vector bundles. After that, we give a generalization of this theorem. Finally, we apply the result to branching laws, and give some concrete examples.
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
A Hausdorff measure version of the Duffin-Schaeffer conjecture in metric number theory is introduced and discussed. The general conjecture is established modulo the original conjecture. The key result is a Mass Transference Principle which…
In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in…
This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…
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…
Degree distributions of many real networks are known to follow the Mandelbrot law, which can be considered as an extension of the power law and is determined by not only the power-law exponent, but also the shifting coefficient. Although…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
In this note we provide an algorithm for translating relational structures into "proper" relational structures, i.e., those such that there is no pair of worlds w and u such that w is accessible from u for every agent. In particular, our…
The purpose of the article is to provide partial proofs for two conjectures given by Witte and Forrester in "Moments of the Gaussian $\beta$ Ensembles and the large $N$ expansion of the densities" with the use of the topological recursion…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We obtain an inverse of Furstenberg's correspondence principle in the setting of countable cancellative, amenable semigroups. Besides being of intrinsic interest on its own, this result allows us to answer a variety of questions concerning…
In this paper, we show that the presence of the Archimedean and the mixture-continuity properties of a binary relation, both empirically non-falsifiable in principle, foreclose the possibility of consistency (transitivity) without…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
Transformers have recently been shown to be capable of reliably performing logical reasoning over facts and rules expressed in natural language, but abductive reasoning - inference to the best explanation of an unexpected observation - has…
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation.…
The aim of this article is to investigate the issues of multiplicative inverses and composition in the set of formal Laurent series. We show the lack of general uniqueness of inverses of formal Laurent series; necessary and sufficient…