Related papers: Rationality for subclasses of 321-avoiding permuta…
We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…
Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.
In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.
Despite the increasing effectiveness of language models, their reasoning capabilities remain underdeveloped. In particular, causal reasoning through counterfactual question answering is lacking. This work aims to bridge this gap. We first…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
Classical higher-order logic, when utilized as a meta-logic in which various other (classical and non-classical) logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach. Universal logic reasoning…
Human syntactic structures are usually represented as graphs. Much research has focused on the mapping between such graphs and linguistic sequences, but less attention has been paid to the shapes of the graphs themselves: their topologies.…
A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…
Grammatical features such as number and gender serve two central functions in human languages. While they encode salient semantic attributes like numerosity and animacy, they also offload sentence processing cost by predictably linking…
Present language understanding methods have demonstrated extraordinary ability of recognizing patterns in texts via machine learning. However, existing methods indiscriminately use the recognized patterns in the testing phase that is…
A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$. Permutation…
Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$\lambda$. We prove that…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
For a fixed integer $m\ge 1$, let $\mathcal{A}_n^{(m)}$ be the set of permutations $\pi\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1}-\pi_i|\le m$ for all $i$. Here, a pattern $132$ means three indices…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
In this paper we continue the study of permutations avoiding the vincular pattern $1-32-4$ by constructing a generating tree with a single label for these permutations. This construction finally provides a clearer explanation of why a…
We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider…