Related papers: Finite Combinatorics and Fragments of Arithmetic

We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…

We study the so-called Gray filtration on the set of phantom maps between two spaces. Using both its algebraic characterization and the Sullivan completion approach to phantom maps, we generalize some of the recent results of Le, McGibbon…

Each degree $n+k$ polynomial of the form $(x+1)^k(x^n+c_1x^{n-1}+\cdots +c_n)$, $k\in \mathbb{N}$, is representable as Schur-Szeg\H{o} composition of $n$ polynomials of the form $(x+1)^{n+k-1}(x+a_j)$. We study properties of the affine…

We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

Using kicked differential equations of motion with derivatives of noninteger orders, we obtain generalizations of the dissipative standard map. The main property of these generalized maps, which are called fractional maps, is long-term…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

We show that for a given initial point the typical, in the sense of Baire category, nonexpansive compact valued mapping $F$ has the following properties: there is a unique sequence of successive approximations and this sequence converges to…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

K. Kato's conjecture about the cohomological Hasse principle for regular connected schemes $\mathfrak X$ which are flat and proper over the complete discrete valuation rings $\mathcal O_N$ of higher local fields $F_N$ is proven. This…

In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the…

Properties of the phase space of the standard maps with memory obtained from the differential equations with the Riemann-Liouville and Caputo derivatives are considered. Properties of the attractors which these fractional dynamical systems…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

I investigate a class of dynamical systems in which finite pieces of spacetime contain finite amounts of information. Most of the guiding principles for designing these systems are drawn from general relativity: the systems are…

In this paper, we develop a loop group description of harmonic maps $\mathcal{F}: M \rightarrow G/K$ of finite uniton number, from a Riemann surface $M,$ compact or non-compact, into inner symmetric spaces of compact or non-compact type. As…

In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…

The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…

We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions…

Let K be a global function field of positive characteristic p and let M be a (commutative) finite and flat K-group scheme. We show that the kernel of the canonical localization map H^{1}(K,M)\to\prod_{all v}H^{1}(K_{v},M) in flat (fppf)…

Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…