Related papers: Towards a statement of the S-adic conjecture throu…
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,…
A monoid $S$ is said to be weakly right coherent if every finitely generated right ideal of $S$ is finitely presented as a right $S$-act. It is known that $S$ is weakly right coherent if and only if it satisfies the following conditions:…
We show that the sequentially $(S_r)$ condition for simplicial complexes is a topological property. Along the way, we present an elementary proof for the fact that the Serre's condition $(S_r)$ is a topological property.
The sign coherence phenomenon is an important feature of c-vectors in cluster algebras with principal coefficients. In this note, we consider a more general version of c-vectors defined for arbitrary cluster algebras of geometric type and…
This paper studies several aspects of symbolic factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts…
We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of…
We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…
A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $|S|=k$. A connected graph $G$ is called $t$-connected if it has more than $t$ vertices and remains connected whenever fewer than $t$…
An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…
Let a finite non-empty X is equipped with discrete topology. We prove that S \subseteq X^\omega is of second category if and only if for each f:\omega -> \bigcup_{n \in \omega} X^n there exists a sequence {a_n}_{n \in \omega} belonging to S…
This paper discusses necessary and sufficient conditions on a monoid S, such that the class of C-flat left $S$-acts is axiomatisable, where C is the class of all embeddings (of right ideals into S) of right S-acts. We consider the…
We formulate conditions on a set of log-concave sequences, under which any linear combination of those sequences is log-concave, and further, of conditions under which linear combinations of log-concave sequences that have been transformed…
We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…
A group is said to be C*-simple if its reduced C*-algebra is simple. We establish an intrinsic (group-theoretic) characterization of groups with this property. Specifically, we prove that a discrete group is C*-simple if and only if it has…
We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…
We obtain a necessary and sufficient condition for an algebraic set in a group to have a fully characteristic radical. As a result, we see that if the radical of a system of equation $S$ over a group $G$ is fully characteristic, then there…