Related papers: Alphabets, rewriting trails and periodic represent…

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.…

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

Since techniques used to address the Nivat's conjecture usually relies on Morse-Hedlund Theorem, an improved version of this classical result may mean a new step towards a proof for the conjecture. In this paper, considering an alphabetical…

For a prime $p\equiv 3\pmod 4$ and a positive integer $t$, let $q=p^{2t}$. The Peisert graph of order $q$ is the graph with vertex set $\mathbb{F}_q$ such that $ab$ is an edge if $a-b\in\langle g^4\rangle\cup g\langle g^4\rangle$, where $g$…

This paper introduces a systematic approach towards the inverse problem for arboreal Galois representations of finite index attached to quadratic polynomials. Let $F$ be a field of characteristic $\neq 2$, $f\in F[x]$ be monic and quadratic…

In this paper, we present new explicit simultaneous rational approximations converging sub-exponentially to the values of Bell polynomials at the points of the form $(\gamma, 1! (2a+1)\zeta(2), 2!\zeta(3),..., (m-1)!(a+1+(-1)^ma)\zeta(m)),$…

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

We represent the Euler alternating series (sometimes called the "Dirichlet eta function"), and generally $(b^s-b)\zeta(s)/b^s$ for $b>1$ an integer, in the half-plane $\Re s>0$, via series dominated by geometric series, with arbitrarily…

A base for a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a sequence of elements of $\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for…

Graph rewriting is a popular tool for the optimisation and modification of graph expressions in domains such as compilers, machine learning and quantum computing. The underlying data structures are often port graphs - graphs with labels at…

We study inequalities between graded Betti numbers of ideals in a standard graded algebra over a field and their images under embedding maps, defined earlier by us in [Math. Z. 274, (2013), no. 3-4, pp. 809-819; arXiv:1009.4488]. We show…

Let $\beta\in(1,2)$ and let $H_\beta$ denote Garsia's entropy for the Bernoulli convolution $\mu_\beta$ associated with $\beta$. In the present paper we show that $H_\beta>0.82$ for all $\beta \in (1, 2)$ and improve this bound for certain…

We define $PC$-polynomial of graph which is related to clique, (in)dependence and matching polynomials. The growth rate of partially commutative monoid is equal to the largest root $\beta(G)$ of $PC$-polynomial of the corresponding graph.…

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…

Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$…

The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzero eigenvalues of A. It is a basis-independent number which is up to a sign the first nonzero entry of the characteristic polynomial of A. We prove…

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…