相关论文: Infinite-Exponent Partition Relations on Higher An…

We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…

We investigate infinite-exponent partition relations on arbitrary relational structures, with a focus on linear orders and graphs. Any such relation contradicts the Axiom of Choice. We show that there are some such relations which are…

We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

A scalar integer partition problem asks for a number of nonnegative integer solutions to a linear Diophantine equation with integer positive coefficients. The manuscript discusses an algorithm of derivation of linear relations involving the…

We consider the four fragments FO2, the intersection of Sigma2 and FO2, the intersection of Pi2 and FO2, and Delta2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

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.

In this work, we study several equivalence relations induced from the partitions of the sets of words of finite length. We have results on words over finite fields extending the work of Bacher (2002, Europ. J. Combinatorics, {\bf 23},…

We prove that if $\leq$ is an analytic partial order then either $\leq$ can be extended to a (boldface) $\Delta^1_2$ linear order similar to an antichain in $2^{<\omega_1}$ ordered lexicographically or a certain Borel partial order $\leq_0$…

We classify finite dimensional division real associative $\mathcal{Z}_2$-algebras, introduce composition $\mathcal{Z}_2$-algebras, and extend the Campbell-Baker-Hausdorff series and Lie correspondence in the context of linear Hu-Liu Leibniz…

We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of…

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

We begin the study of the representation theory of the infinite Temperley-Lieb algebra. We fully classify its finite dimensional representations, then introduce infinite link state representations and classify when they are irreducible or…

This paper deals with the Mittag-Leffler polynomials (MLP) by extracting their essence which consists of real polynomials with fine properties. They are orthogonal on the real line instead of the imaginary axes for MLP. Beside recurrence…

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…

In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…

We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIME-complete. While containment…

In this paper a general theorem of constructing infinite particle systems of jump types with long range interactions is presented. It can be applied to the system that each particle undergoes an $\alpha$-stable process and interaction…