相关论文: Kolmogorov complexity and symmetric relational str…

Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

We introduce the notion of radical preservation and prove that a radical-preserving homomorphism of left artinian rings of finite projective dimension with superfluous kernel reflects the finiteness of the little finitistic, big finitistic…

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…

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 consider the following notion due to N.Thi\'ery and the second author. A…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

We study multiple chordal SLE$(\kappa)$ systems in a simply connected domain $\Omega$, where $z_1, \ldots, z_n \in \partial \Omega$ are boundary starting points and $q \in \partial \Omega$ is an additional marked boundary point. As a…

There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…

The complete algebraic structure of semisimple finite group algebra of a generalized strongly monomial group is provided. This work extends the work of Broche and del R{\'{\i}}o on strongly monomial groups. The theory is complimented by an…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…

The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…

In this note we develop some properties of those algebras (called here locally simple) which can be generated by a single element after, if need be, a faithfully flat extension. For finite algebras, this is shown to be in fact a property of…

Let $E$ be a subset of the affine plane over a finite field $\mathbb{F}_q$. We bound the size of the subgroup of $SL_2(\mathbb{F}_q)$ that preserves $E$. As a consequence, we show that if $E$ has size $\ll q^\alpha$ and is preserved by $\gg…

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…

Within psychology, neuroscience and artificial intelligence, there has been increasing interest in the proposal that the brain builds probabilistic models of sensory and linguistic input: that is, to infer a probabilistic model from a…