Related papers: A graphon counter example

We construct an example of a real plane analytic singular metric, degenerating only at the origin, such that any gradient trajectory (respectively to this singular metric) of some well chosen function spirals around the origin. The…

The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on…

Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…

We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.

We present simple examples of rational maps of the complex projective plane with equal first and second dynamical degrees and no invariant foliation.

In this addendum to [4], we provide a pair of counterexamples relevant to the theory of implicit operations. More precisely, we exhibit a pp expansion of a variety that fails to be a variety (although it is a quasivariety). Furthermore, we…

We show that a weakly holomorphic modular function can be written as a sum of modular units of higher level. We further find a necessary and sufficient condition for a Siegel modular function of degree $g$ to have neither zero nor pole on…

Among abelian extensions of a congruence function field, an asymptotic relation of class number and genus is established. The proof is classical, employing well-known results from congruence function field theory.

We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…

We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an…

For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing…

Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in $[T-a,T+a]$. We also prove a bound for the multiplicity of the zeros.

We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the…

Recently, the author found that there is a common mistake in some papers by using minimal counterexample and discharging method. We first discuss how the mistake is generated, and give a method to fix the mistake. As an illustration, we…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

We consider positive-(1,1) De Rham currents in arbitrary almost complex manifolds and prove the uniqueness of the tangent cone at any point where the density does not have a jump with respect to all of its values in a neighbourhood. Without…

Let A be an arbitrary countable set of reals, for example A=Q. Let g be an arbitrary mapping from A into the positive reals, for example g(a)=2^a. We show how a strictly increasing real function f can be constructed such that f'(x)=g(x) for…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

Assume $G$ is a graph and $k$ is a positive integer. Let $f:V(G)\to \mathbb{N}$ be defined as $f(v)=\min\{k,d_G(v)\}$. If $G$ is $f$-choosable, then we say $G$ is degree-truncated $k$-choosable. Answering a question of Richter, it was…