Related papers: Partially Palindromic Compositions
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
The prefix palindromic length $p_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. This function is surprisingly difficult to…
While there has been increasing interest in using neural networks to compute Lyapunov functions, verifying that these functions satisfy the Lyapunov conditions and certifying stability regions remain challenging due to the curse of…
In a recent paper, G. Cz\'edli and E.\,T. Schmidt present a structure theorem for planar semimodular lattices. In this note, we present an alternative proof.
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,…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
In this paper, we are mainly interested in the two questions "which are the commutative rings on which every finitely presented modules is [Formula: see text]-periodic (respectively, [Formula: see text]-periodic)?". It is proved that these…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We obtain a complete description of the Riesz measures of almost periodic subharmonic functions with at most of linear growth on the complex plane; as a consequence we get a complete description of zero sets for the class of entire…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
We study subharmonic functions whose Laplacian is supported on a null set and in connected components of of the complement to the support admit harmonic extensions to larger sets. We prove that if such a function has a piecewise holomorphic…