Related papers: Notes on the ordered set $A^A$. Part III. Exponent…

We extend Ahlbrandt and Ziegler's reconstruction results to the metric setting: we show that separably categorical metric structures are determined, up to bi-interpretability, by their automorphism groups.

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

We prove, in particular, that for any finite set of real numbers A with |A/A| \ll |A| one has |A-A| > |A|^{5/3 - o(1)}. Also we show that |3A| > |A|^{2-o(1)} in the case.

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We classify the representation type of the descent algebras of type $\A$ in the positive characteristic case. The algebras have finite representation type only for a few small degrees; otherwise, they are wild. Our main reduction method…

Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We introduce a notion of degenerations of graded modules. In relation to it, we also introduce several partial orders as graded analogies of the hom order, the degeneration order and the extension order. We prove that these orders are…

In this article, we investigate the category $\mathcal{A}^G$ of equivariant objects of an additive category $\mathcal{A}$ with respect to an action of a finite group $G$. We show that if $G$ is solvable then we can reconstruct $\mathcal{A}$…

Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…

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…

We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

In the note we prove that all composition factors of a finite group possessing a Carter subgroup of odd order either are abelain, or are isomorphic to $L_2(3^{2n+1})$.

Let $q$ be a prime and $A$ a finite $q$-group of exponent $q$ acting by automorphisms on a finite $q'$-group $G$. Assume that $A$ has order at least $q^3$. We show that if $\gamma_{\infty} (C_{G}(a))$ has order at most $m$ for any $a \in…

Let $\mathcal{A} = \mathcal{A}(W)$ be the reflection arrangement of the finite complex reflection group $W$. By Terao's famous theorem, the arrangement $\mathcal{A}$ is free. In this paper we classify all reflection arrangements which…

In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…

A poset is $(\omega,C)$-representable if it can be embedded into a field of sets in such a way that all existing joins, and all existing \emph{finite} meets are preserved. We show that the class of $(\omega,C)$-representable posets cannot…

We introduce a recursive method to deconstruct the automorphism group of an ordered set. By connecting this method with deep results for permutation groups, we prove the Automorphism Conjecture for ordered sets of width less than or equal…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…