Related papers: Locally countable graphs of second projective clas…

The purpose of this paper has twofold. The first is to establish a second main theorem with truncated counting functions for algebraically nondegenerate meromorphic mappings into an arbitrary projective variety intersecting a family of…

Given a continuous dynamical system $f:X\to X$ on a compact metric space $X$ and an $m$-dimensional continuous potential $\Phi:X\to \mathbb R^m$, the (generalized) rotation set ${\rm Rot}(\Phi)$ is defined as the set of all $\mu$-integrals…

We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…

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…

A numeric function $\rho$: $\rho(k)=1+\frac{k-1}{k+1}, k \in N$ was considered in [1]. In its terms criterions of finite representability and tameness of marked quivers, posets with equivalence and dyadic posets can be obtained; Dynkin…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

Dana P. Williams raised in [Proc. Am. Math. Soc., Ser. B, 2016] the following question: Must a second countable, locally compact, transitive groupoid have open range map? This paper gives a negative answer to that question. Although a…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…

Let $G$ be a matrix group. Topological $G$-manifolds with Palais-proper action have the $G$-homotopy type of countable $G$-CW complexes (3.2). This generalizes E Elfving's dissertation theorem for locally linear $G$-manifolds (1996). Also…

Let $G=(V,E)$ be a finite graph. For $v\in V$ we denote by $G_v$ the subgraph of $G$ that is induced by $v$'s neighbor set. We say that $G$ is $(a,b)$-regular for $a>b>0$ integers, if $G$ is $a$-regular and $G_v$ is $b$-regular for every…

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…

We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.

We show that if $Y$ is a toroidal closed graph manifold rational homology $3$-sphere with $|H_1(Y;\mathbb{Z})| \le 5$, then there exists an irreducible representation $\fund{Y} \to SU(2)$, using topological methods and avoiding the use of…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p \in (0, 1)$, independently of other pairs. In this article,…

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…