English
Related papers

Related papers: On automatic subsets of the Gaussian integers

200 papers

Let $k \,=\, \mathbb{Q}(\sqrt[5]{n},\zeta_5)$, where $n$ is a positive integer, $5^{th}$ power-free, whose $5-$class group is isomorphic to $\mathbb{Z}/5\mathbb{Z}\times\mathbb{Z}/5\mathbb{Z}$. Let $k_0\,=\,\mathbb{Q}(\zeta_5)$ be the…

Number Theory · Mathematics 2022-03-25 Fouad Elmouhib , Mohamed Talbi , Abdelmalek Azizi

We give a construction of Gorenstein projective $\tau$-tilting modules in terms of tensor products of modules. As a consequence, we give a class of non-self-injective algebras admitting non-trivial Gorenstein projective $\tau$-tilting…

Representation Theory · Mathematics 2022-01-13 Zhi-Wei Li , Xiaojin Zhang

We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…

Number Theory · Mathematics 2022-08-04 Haruki Ide , Taka-aki Tanaka

Let pi be a regular, algebraic, essentially self-dual cuspidal automorphic representation of GL_n(A_F), where F is a totally real field and n is at most 5. We show that for all primes l, the l-adic Galois representations associated to pi…

Number Theory · Mathematics 2016-10-11 Frank Calegari , Toby Gee

We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…

Operator Algebras · Mathematics 2013-12-04 Takahiro Hasebe

A maximal independent set is an independent set that is not a subset of any other independent set. It is also the key problem of mathematics, computer science, and other fields. A counting problem is a type of computational problem that…

Computational Complexity · Computer Science 2024-09-16 Hao Zhang , Tonghua Su

We characterize the indecomposable transjective modules over an arbitrary cluster-tilted algebra that do not lie on a local slice, and we provide a sharp upper bound for the number of (isoclasses of) these modules.

Representation Theory · Mathematics 2016-06-17 Ibrahim Assem , Ralf Schiffler , Khrystyna Serhiyenko

We study subproduct systems in the sense of Shalit and Solel arising from stochastic matrices on countable state spaces, and their associated operator algebras. We focus on the non-self-adjoint tensor algebra, and Viselter's generalization…

Operator Algebras · Mathematics 2016-11-18 Adam Dor-On , Daniel Markiewicz

In this paper we present a non-Gaussian integral based on a cubic polynomial, instead of a quadratic, and give a fundamental formula in terms of its discriminant. It gives a mathematical reinforcement to the recent result by Morozov and…

Mathematical Physics · Physics 2011-03-07 Kazuyuki Fujii

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

Number Theory · Mathematics 2008-01-28 Werner Bley , Henri Johnston

This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.

Group Theory · Mathematics 2021-02-09 Bettina Eick

We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail. Let…

Formal Languages and Automata Theory · Computer Science 2019-02-05 Achilles A. Beros , Bjørn Kjos-Hanssen , Daylan Kaui Yogi

Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…

Formal Languages and Automata Theory · Computer Science 2025-04-16 Verónica Becher , Simon Lew Deveali , Ignacio Mollo Cunningham

This article is the third and last part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. This part proves the following new result for the inverse…

Number Theory · Mathematics 2013-09-24 Sara Arias-de-Reyna , Luis Dieulefait , Sug Woo Shin , Gabor Wiese

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

Formal Languages and Automata Theory · Computer Science 2023-05-01 Thomas Place , Marc Zeitoun

We construct motivic $\ell$-adic representations of $\GQ$ into exceptional groups of type $E_7,E_8$ and $G_2$ whose image is Zariski dense. This answers a question of Serre. The construction is uniform for these groups and uses the…

Number Theory · Mathematics 2011-12-13 Zhiwei Yun

Let a and b be any two elements in the group Zn of integers modulo n. Then a and b are called independent if O(a) not equal to O(b) . In this paper, we introduce and study independent graph of the group Zn, denoted by IG(Zn), is undirected…

Group Theory · Mathematics 2018-06-20 T. Chalapathi , R. V M S S Kiran Kumar

The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…

Group Theory · Mathematics 2017-06-07 Yuqun Chen , Haibin Wu , Honglian Xie

We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N \alpha \le x} \mathfrak{t}_k(\alpha)$, where $N$ stands for the norm of a…

Number Theory · Mathematics 2019-02-12 Andrew V. Lelechenko

Two Schubert problems on possibly different Grassmannians may be composed to obtain a Schubert problem on a larger Grassmannian whose number of solutions is the product of the numbers of the original problems. This generalizes a…

Algebraic Geometry · Mathematics 2020-06-15 Frank Sottile , Robert Williams , Li Ying