Related papers: Finite Combinatorics and Fragments of Arithmetic

For an integer $m \geq 2$, let $\mathcal{P}_m$ be the partition of the unit interval $I$ into $m$ equal subintervals, and let $\mathcal{F}_m$ be the class of piecewise linear maps on $I$ with constant slope $\pm m$ on each element of…

In this paper we prove geometric residue theorems for bundle maps over a compact manifold. The theory developed associates residues to the singularity submanifolds of the map for any invariant polynomial. The theory is then applied to a…

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

Motivated by the theory of harmonic maps on Riemannian surfaces, conformal-harmonic maps between two Riemannian manifolds $M$ and $N$ were introduced in search of a natural notion of harmonicity for maps defined on a general even…

Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…

In this paper, we show the Hasse principle for the character group of a finitely generated field over the rational number field. By applying this result, we obtain an algebraic proof of unramified class field theory of arithmetical schemes.

Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Ends and end cohomology are powerful invariants for the study of noncompact spaces. We present a self-contained exposition of the topological theory of ends and prove novel extensions including the existence of an exhaustion of a proper…

Effective bounds for the finite number of surjective holomorphic maps between canonically polarized compact complex manifolds of any dimension with fixed domain are proven. Both the case of a fixed target and the case of varying targets are…

We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the…

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…