Related papers: On GCD-morphic sequences

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…

It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the…

If $(G,V)$ is a polar representation with Cartan subspace $\mathfrak c$ and Weyl group $W$, it is shown that there is a natural morphism of Poisson schemes $\mathfrak c \oplus {\mathfrak c}^*/W \to V\oplus V^*/\!\!/\!\!/ G$. This morphism…

We provide a complete system of invariants for the formal classification of complex analytic unipotent germs of diffeomorphism at $\cn{n}$ fixing the orbits of a regular vector field. We reduce the formal classification problem to solve a…

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

In this paper, we introduce integer sequences satisfying new congruence properties inspired by the Euler and Gauss congruences, which we call Euler-Gauss sequences. Noting that every Gauss sequence is an Euler-Gauss sequence, we compare…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois…

Let $R$ be a Noetherian ring and $x_1,\ldots,x_t$ a permutable regular sequence of elements in $R$. Then there exists a finite set of primes $\Lambda$ and natural number $C$ so that for all $n_1,\ldots,n_t$ there exists a primary…

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO)…

The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…

A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…

Characteristic modes of a spherical shell are found analytically as spherical harmonics normalized to radiate unitary power and to fulfill specific boundary conditions. The presented closed-form formulas lead to a proposal of precise…

We deal with first-order definability in the embeddability ordering $( \mathcal{D}; \leq)$ of finite directed graphs. A directed graph $G\in \mathcal{D}$ is said to be embeddable into $G' \in \mathcal{D}$ if there exists an injective graph…

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…

We prove that every odd-order group is symmetric harmonious: there exists a permutation $g_0,g_1,\ldots, g_{\ell-1}$ of elements of $G$ such that the consecutive products $g_0g_1,g_1g_2,\ldots, g_{\ell-1}g_0$ also form a permutation of…