Related papers: Sufficient Conditions for Labelled 0-1 Laws

We show that every proper minor-closed class of graphs admits a $(1+o(1))\log_2 n$-bit adjacency labelling scheme. Equivalently, for every proper minor-closed class $\mathcal{G}$ and every positive integer $n$ there exists an…

We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifier rank) of a such sentence. We define the succinctness…

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

This article establishes necessary and sufficient conditions under which a finite set of Generalized Shannon's Entropy (GSE) characterizes a finite discrete distribution up to permutation. For an alphabet of cardinality K, it is shown that…

We give a sufficient and necessary condition such that for almost all $s\in{\mathbb R}$ \[ \|n\theta-s\|<\psi(n)\qquad\text{for infinitely many}\ n\in{\mathbb N}, \] where $\theta$ is fixed and $\psi(n)$ is a positive, non-increasing…

As essential condition for the validy of Robin's Theorem as a precondition for the proof of the Riemann hypothesis, we show that the minimum of the function $F={\rm e}^{\gamma}\,\ln(\ln\,n)-\sigma(n)/n$ is found to be positive. Therefore,…

A real polynomial $f$ is called local nonnegative at a point $p$, if it is nonnegative in a neighbourhood of $p$. In this paper, a sufficient condition for determining this property is constructed. Newton's principal part of $f$ (denoted as…

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…

Let G_<(n,p) denote the usual random graph G(n,p) on a totally ordered set of n vertices. We will fix p=1/2 for definiteness. Let L^< denote the first order language with predicates equality (x=y), adjacency (x~y) and less than (x<y). For…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

Current techniques for generating a knowledge space, such as QUERY, guarantees that the resulting structure is closed under union, but not that it satisfies wellgradedness, which is one of the defining conditions for a learning space. We…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every…

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

This note is a response to one of the problems posed by Kwa\'sniewski in [1,2], see also [3] i.e. GCD-morphic Problem III. We show that any GCD-morphic sequence $F$ is at the point product of primary GCD-morphic sequences and any…

If the $n-th$ order differential equation is not exact, under certain conditions, an integrating factor exists which transforms the differential equation into an exact one. Hence, its order can be reduced to the lower order. In this paper,…

A 0-1 matrix $M$ contains a 0-1 matrix pattern $P$ if we can obtain $P$ from $M$ by deleting rows and/or columns and turning arbitrary 1-entries into 0s. The saturation function $\mathrm{sat}(P,n)$ for a 0-1 matrix pattern $P$ indicates the…