Related papers: The Conjugacy Relation on One-sided Subshifts is N…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the…
In this paper, we consider inverse limits of $[0,1]$ using upper semicontinuous set-valued functions. We aim to expand on a previous paper exploring the relationship between the existence periodic points of a continuous function to the…
Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…
We study local piecewise conjugacy of the quantized dynamics arising from factorial languages. We show that it induces a bijection between allowable words of same length and thus it preserves entropy. In the case of sofic factorial…
In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…
A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…
We study a parametric deformation of the unified genus-1 anharmonic potential and derive a parametric form of perturbative/nonperturbative (P/NP) relation, applicable across all parameter values. We explicitly demonstrate that the…
We introduce and study conjugate reversibility (or $c$-reversibility) in the complex special linear group $\SL(n,\C)$ where an element is conjugate to the inverse of its complex conjugate. We prove that in $\SL(n, \C)$, every $c$-reversible…
A hom-associative structure is a set $A$ together with a binary operation $\star$ and a selfmap $\alpha$ such that an $\alpha$-twisted version of associativity is fulfilled. In this paper, we assume that $\alpha$ is surjective. We show that…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been several attempts to extend the notion of conjugacy to semigroups. In this paper, we present a…
Let $k$ be an algebraically closed field, $G$ a linear algebraic group over $k$ and $\varphi\in Aut(G)$, the group of all algebraic group automorphisms of $G$. Two elements $x, y$ of $G$ are said to be $\varphi$-twisted conjugate if…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
Given a one-sided subshift $X$ on a finite alphabet, we consider the semigroup $S_X =L_X \cup \{0\}$, where $L_X $ is the language of $X $, equipped with the multiplication operation given by concatenation, when allowed, and set to vanish…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
We characterize the compatibility of a collection of unrooted phylogenetic trees as a question of determining whether a graph derived from these trees --- the display graph --- has a specific kind of triangulation, which we call legal. Our…
We demonstrate that commutativity of numerous one-dimensional subalgebras in $W_{1+\infty}$ algebra, i.e. the existence of many non-trivial integrable systems described in recent arXiv:2303.05273 follows from the subset of relations in…
A $(0,1)$-labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let $g$ be a labeling of the edge set of a graph that is induced by a labeling $f$ of the vertex…
The arrow relation, a central concept in extremal set theory, captures quantitative relationships between families of sets and their traces. Formally, the arrow relation $(n, m) \rightarrow (a, b)$ signifies that for any family $\mathcal{F}…