Related papers: Finite Combinatorics and Fragments of Arithmetic
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…
We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal $\omega$. Four natural formulations are presented and their relative strengths are compared. In the analysis of the pigeonhole principle for…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
Refined are the known descriptions of particle behavior with the help of Hamilton function in the phase space of coordinates and their multiple derivatives. This entails existing of circumstances when at closer distances gravitational…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
The class of special generic maps contains Morse functions with exactly two singular points, characterizing spheres topologically which are not $4$-dimensional and the $4$-dimensional unit sphere. This class is for higher dimensional…
We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…
We construct a locally profinite set of cardinality $\aleph_{\omega}$ with infinitely many first cohomology classes of which any distinct finite product does not vanish. Building on this, we construct the first example of a nondescendable…
Polyharmonic maps of order k (briefly, k-harmonic maps) are a natural generalization of harmonic and biharmonic maps. These maps are defined as the critical points of suitable higher order functionals which extend the classical energy…
We develop the foundations of logarithmic structures beyond the standard finiteness conditions. The motivation is the study of semistable models over general valuation rings. The key new notion is that of a morphism of finite presentation…
We study the Gray index of phantom maps, which is a numerical invariant of phantom maps. It is conjectured that the only phantom map with infinite Gray index between finite-type spaces is the constant map. We disprove this conjecture by…
Let \(\mathbb D\) denote the unit disc in \(\mathbb C\). For a domain \(D\subset\mathbb C\) and a point \(p\in D\), let \(M_D(p)\) denote the supremum of \(\|df_0\|\) over all harmonic maps \(f:\mathbb D\to D\) with \(f(0)=p\) whose…
Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…