Related papers: On GCD-morphic sequences

Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented. Interestingly enough all those problems so far are…

We encode the sequence of prime numbers into simple superpositions of identical waves, mimicking the archetypal prime number sieve of Eratosthenes. The primes are identified as zeros accompanied by phase singularities in a physically…

We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it…

Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chi^c(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen, it was shown that $G$ cannot satisfy the condition…

We report on our lattice calculations of the nucleon's generalized parton distributions (GPDs), concentrating on their first moments for the case of N_f=2. Due to recent progress on the numerical side we are able to present results for the…

The Guarded Fragment (GF) is a well-established decidable fragment of first-order logic. We study an extension of GF with nested equivalence relations, namely a family of distinguished binary predicates $E_1, E_2, \dots$ interpreted as…

A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…

Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given two different set of tokens on vertices of a graph $G$, we…

We show how one can associate to a given class of finite type G-structures a classifying Lie algebroid. The corresponding Lie groupoid gives models for the different geometries that one can find in the class, and encodes also the different…

Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…

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$…

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

Let $p$ be a prime number, $\Bbbk$ a field of characteristic $p$ and $G$ a finite $p$-group acting on a standard graded polynomial ring $S = \Bbbk[x_1, \ldots, x_n]$ as degree-preserving $\Bbbk$-algebra automorphisms. Assume that $G$ is…

We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

Let G be a finite group. We explore the model theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential field automorphisms. In the language of…

In this article we define $G$-algebras, that is, graded algebras on which a reductive group $G$ acts as gradation preserving automorphisms. Starting from a finite dimensional $G$-module $V$ and the polynomial ring $\mathbb{C}[V]$, it is…

We study the locality of critical percolation on finite graphs: let $G_n$ be a sequence of finite graphs, converging locally weakly to a (random, rooted) infinite graph $G$. Consider Bernoulli edge percolation: does the critical probability…

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

Let $k$ be a field, and $G$ be a $k$-group scheme of finite type. Let $G_{\mathrm{ad}}$ be the $k$-scheme $G$ with the adjoint action of $G$. We call $\lambda_{G,G}=H^0(\mathop{\mathrm{Spec}} k,e^*(\omega_{G_{\mathrm{ad}}}))$ the Knop…