Related papers: Br\"uck Conjecture with hyper-order less than one
Considering differential equation f''+A(z)f'+B(z)f=0, where A(z) and B(z) are entire complex functions, our results revolve around proving all non-trivial solutions are of infinite order taking various restrictions on coefficients A(z) and…
We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
For a second order linear differential equation $f''+A(z)f'+B(z)f=0$, with $ A(z)$ and $B(z)$ being transcendental entire functions under some restriction, we have established that all non-trivial solutions are of infinite order. In…
This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial…
Let $G$ be a finite group and let $\textrm{cd}(G)$ be the set of all complex irreducible character degrees of $G.$ In this paper, we show that if $\textrm{cd}(G)=\textrm{cd}(H),$ where $H$ is a finite simple exceptional group of Lie type,…
In this paper, we first prove the existence of solutions to Dirichlet problems involving the fractional $g$-Laplacian operator and lower order terms by appealing to sub- and supersolution methods. Moreover, we also state the existence of…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
Webb's conjecture states that the orbit space of the Brown complex of a finite group at any given prime $\ell$ is contractible. This conjecture was proved by Symonds in 1998. In this paper, we suggest a generalisation of Webb's conjecture…
Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)\! =\!d\!+\!1$. We prove that $f(d)\! \ge\! (1.2)^{\sqrt d}$ for…
Matatyahu Rubin has shown that a sharp version of Vaught's conjecture, $I({\mathcal T},\omega )\in \{ 0,1,{\mathfrak{c}}\}$, holds for each complete theory of linear order ${\mathcal T}$. We show that the same is true for each complete…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.
In this paper, we present a new necessary and sufficient condition for which the supremum exists with respect to the logic order. Moreover, we give out a new and much simpler representation of the supremum with respect to the order, our…