Related papers: Finite Combinatorics and Fragments of Arithmetic
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…
The concept of nimbers--a.k.a. Grundy-values or nim-values--is fundamental to combinatorial game theory. Nimbers provide a complete characterization of strategic interactions among impartial games in their disjunctive sums as well as the…
We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
We give a short elementary proof of the main theorem in the paper "Differential calculus on graphon space" by Diao et al. (JCTA 2015), which says that any graphon parameters whose $(N+1)$-th derivatives all vanish must be a linear…
We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
This paper considers the problems of finite determinacy and approximation of flat analytic maps from germs of real or complex analytic spaces. It is shown that the flatness of analytic maps from germs of real or complex analytic spaces…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
Fold maps are fundamental tools in the theory of singularities of differentiable maps and its applications to geometry. They are higher dimensional variants of Morse functions. Classes of special generic maps and round fold maps are…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
In this paper, we mainly derive monotonicity formula of generalized map using conservation law, including $\phi$-$F$ harmonic map coupled with $\phi$-$F$ symphonic map with $m$ form and potential from metric measure space, $ p $ harmonic…
In this paper, we investigate whether Variational Principles can be associated with the Helmholtz equation subject to impedance (absorbing) boundary conditions. This model has been extensively studied in the literature from both…
We prove generalized Gaffney inequalities and the discrete compactness for finite element differential forms on $s$-regular domains, including general Lipschitz domains. In computational electromagnetism, special cases of these results have…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
It is known that the spin structure on a Riemannian manifold can be extended to noncommutative geometry using the notion of a spectral triple. For finite geometries, the corresponding finite spectral triples are completely described in…
We study the pigeonhole principle for $\Sigma_2$-definable injections with domain twice as large as the codomain, and the weak K\"onig lemma for $\Delta^0_2$-definable trees in which every level has at least half of the possible nodes. We…
In this survey, we review some of the recent connections between the representation theory of (untwisted) quantum affine algebras and the representation theory of current algebras. We mainly focus on the finite-dimensional representations…
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…