Related papers: Automatic Abelian Complexities of Parikh-Collinear…
We propose to study value automata with filters, a natural generalization of regular cost automata to nondeterminism. Models such as weighted automata and Parikh automata appear naturally as specializations. Results on the expressiveness of…
We study the interaction between the group law on an abelian variety and the additive structure induced on its image under a morphism to projective space. Let $A/F$ be a simple abelian variety, $f:A \rightarrow \mathbb{P}^n$ be a morphism…
We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.
The PPF dependent fixed point result in algebraically closed Razumikhin classes due to Agarwal et al [Fixed Point Theory Appl., 2013, 2013:280] is identical with its constant class counterpart; and this, in turn, is reducible to a fixed…
We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical $k$-automatic sequences and…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
We show that on an Abelian variety over an algebraically closed field of positive characteristic, the obstruction to lifting an automorphism to an Abelian variety over a field of characteristic zero as a morphism vanishes if and only if it…
$\operatorname{SL}(2,q)$-unitals are unitals of order $q$ admitting a regular action of $\operatorname{SL}(2,q)$ on the complement of some block. They can be obtained from affine $\operatorname{SL}(2,q)$-unitals via parallelisms. We compute…
We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized…
Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer…
Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…
We prove an algebraic version of a classical theorem in topology, asserting that an abelian p-group action on a smooth projective variety of positive dimension cannot fix exactly one point. When the group has only two elements, we prove…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We show that if a rational map is constant on each isomorphism class of unpolarized abelian varieties of a given dimension, then it is a constant map. Our results are motivated by and shed light on a proposed construction of a cryptographic…
We study the relationship between singularities of bi-Hamiltonian systems and algebraic properties of compatible Poisson brackets. As the main tool, we introduce the notion of linearization of a Poisson pencil. From the algebraic viewpoint,…
We study morphisms from certain classes and their action on episturmian words. The first class is $P_{ret}$. In general, a morphism of class $P_{ret}$ can map an infinite word having zero palindromic defect to a word having infinite…
We show that the problem of whether the fixed point of a morphism avoids Abelian $k$-powers is decidable under rather general conditions
Motivated by the work of Esnault-Hai, one has the notion of de Rham $K(\pi,1)$ schemes, defined as follows. Given a smooth proper geometrically connected scheme $X$ over a field $k$ of characteristic 0 and a base point $x \in X (k)$, one…
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in…