Related papers: Br\"uck Conjecture with hyper-order less than one

We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

Let $\mathcal{B}$ be a homogeneous differential operator of order $l=1$ or $l=2$. We show that a sequence of functions of the form $(\mathcal{B}u_j)_j$ converging in the $L^1$-sense to a compact, convex set $K$ can be modified into a…

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…

A Dirichlet-type problem is studied for an equation of even order with variable coefficients. A criterion for the uniqueness of a solution is given. The solution is built in the form of a Fourier series. When justifying the convergence of…

Recently, a new conjecture on the degrees of the irreducible Brauer characters of a finite group was presented by the second author. In this paper we propose a 'local' version of this conjecture for blocks B of finite groups, giving a lower…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

We show that, for every linear ordering of $[2]^n$, there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long monotone subsequence supported on an affine cube. More…

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

K. Harada conjectured for any finite group $G$, the product of sizes of all conjugacy classes is divisible by the product of degrees of all irreducible characters. We study this conjecture when $G$ is the general linear group over a finite…

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

We show that in order to decide whether a given probability measure is laminate it is enough to verify Jensen's inequality in the class of extremal non-negative rank-one convex integrands. We also identify a subclass of these extremal…

We study the size of the exceptional set in the $abc$ conjecture, improving on and simplifying work of Browning, Lichtman and Ter\"av\"ainen.

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…

In this paper we give a short, elementary proof of the following too extreme cases of the Leopoldt conjecture: the case when $\K/\Q$ is a solvable extension and the case when it is a totally real extension in which $p$ splits completely.…

The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der…