Related papers: Cohen Generic Structures with Functions

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thi\'ery and the second author.…

For a class $\mathcal C$ of graphs $G$ equipped with functions $f_G$ defined on subsets of $E(G)$ or $V(G)$, we say that $\mathcal{C}$ is $k$-scattered with respect to $f_G$ if there exists a constant $\ell$ such that for every graph $G\in…

Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Classic complex analysis is built on structural function $K=1$ only associated with Cauchy-Riemann equations, subsequently various generalizations of Cauchy-Riemann equations start to break this situation. The goal of this article is to…

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…

Generalizing and simplifying recent work of Dobrinen, we show that if $\mathcal{L}$ is a finite binary relational language and $\mathcal{F}$ is a finite set of finite irreducible $\mathcal{L}$-structures, then the class $\mathcal{K} =…

Quasiorders $\varrho\subseteq A^{2}$ have the property that an operation $f:A^{n}\to A$ preserves $\varrho$ if and only if each (unary) translation obtained from $f$ is an endomorphism of $\rho$. Generalized quasiorders $\rho\subseteq A^{m}…

Generating rational and generally accurate responses to tasks, often accompanied by example demonstrations, highlights Large Language Model's (LLM's) remarkable In-Context Learning (ICL) capabilities without requiring updates to the model's…

The Mitsch order is already known as a natural partial order for semigroups and rings. The purpose of this paper is to further study of the Mitsch order on modules by investigating basic properties via endomorphism rings. And so this study…

Let $kE$ denote the group algebra of an elementary abelian $p$-group of rank $r$ over an algebraically closed field of characteristic $p$. We investigate the functors $\mathcal{F}_i$ from $kE$-modules of constant Jordan type to vector…

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…

The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose $K$ is a compact set in the complex plane and 0 belongs to the boundary $\partial K$. Let ${\cal A}(K)$ denote the space of all functions $f$ on $K$…

Let $G:\mathbb{R\rightarrow R}$ be a continuous function. In the first part of this paper, we investigate sufficient conditions on $G$ such that \begin{equation*} \{G(f):f\in \dot{K}_{p,q}^{\alpha }F_{\beta }^{s}\}\subset…

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

It is known that for subgraph-closed graph classes the first-order model checking problem is fixed-parameter tractable if and only if the class is nowhere dense [Grohe, Kreutzer, Siebertz, STOC 2014]. However, the dependency on the formula…

We study the generic properties of finitely presented monoids and semigroups. We show that for positive integers a > 1, k and m, the generic a-generator k-relation monoid and semigroup presentation (defined in any of several definite…

A prefix code L satisfies the condition that no word of L is a proper prefix of another word of L. Recently, Ko, Han and Salomaa relaxed this condition by allowing a word of L to be a proper prefix of at most k words of L, for some `margin'…

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…