English
Related papers

Related papers: Rational matrix digit systems

200 papers

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

Number Theory · Mathematics 2015-12-10 Maciej Gawron

Let $\Lambda$ be an artin algebra and $\mathcal{C}$ be a functorially finite subcategory of mod$\Lambda$ which contains $\Lambda$ or $D\Lambda$. We use the concept of the infinite radical of $\mathcal{C}$ and show that $\mathcal{C}$ has an…

Representation Theory · Mathematics 2023-12-22 Raziyeh Diyanatnezhad , Alireza Nasr-Isfahani

In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…

General Mathematics · Mathematics 2021-06-28 Jeong-Ok Choi , Youngmi Hur

Let $n$ be a natural number and $\mathcal{M}$ a set of $n \times n$-matrices over the nonnegative integers such that the joint spectral radius of $\mathcal{M}$ is at most one. We show that if the zero matrix $0$ is a product of matrices in…

Formal Languages and Automata Theory · Computer Science 2021-03-01 Stefan Kiefer , Corto Mascle

Let $D\in\mathbb{N}$, let $A>D+1$, and let $Q\geqslant3$. Consider the class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ such that $|\sum_{n\leqslant x}f(n)|\le x(\log Q)^{A-D-1}/(\log x)^A$ for all $x\geqslant Q$, and such that…

Number Theory · Mathematics 2026-05-05 Dimitris Koukoulopoulos

Suppose p is a symmetric matrix whose entries are polynomials in freely noncommutating variables and p(0) is positive definite. Let D(p) denote the component of zero of the set of those g-tuples X of symmetric matrices (of the same size)…

Functional Analysis · Mathematics 2012-11-22 J. William Helton , Scott McCullough

We propose an extension of the numerical approach for integrable Richardson-Gaudin models based on a new set of eigenvalue-based variables. Starting solely from the Gaudin algebra, the approach is generalized towards the full class of XXZ…

Statistical Mechanics · Physics 2015-04-08 Pieter W. Claeys , Stijn De Baerdemacker , Mario Van Raemdonck , Dimitri Van Neck

We consider the four structures $(\mathbb{Z}; \mathrm{Sqf}^\mathbb{Z})$, $(\mathbb{Z}; <, \mathrm{Sqf}^\mathbb{Z})$, $(\mathbb{Q}; \mathrm{Sqf}^\mathbb{Q})$, and $(\mathbb{Q}; <, \mathrm{Sqf}^\mathbb{Q})$ where $\mathbb{Z}$ is the additive…

Logic · Mathematics 2022-03-15 Neer Bhardwaj , Minh Chieu Tran

We consider digital expansions in lattices with endomorphisms acting as base. We focus on the $w$-non-adjacent form ($w$-NAF), where each block of $w$ consecutive digits contains at most one non-zero digit. We prove that for sufficiently…

Number Theory · Mathematics 2015-04-13 Clemens Heuberger , Daniel Krenn

Let $D\subseteq B$ be an extension of integral domains and $E$ a subset of the quotient field of $D$. We introduce the ring of \textit{$D$-valued $B$-rational functions on $E$}, denoted by $Int^R_B(E,D)$, which naturally extends the…

Commutative Algebra · Mathematics 2024-11-07 Mohamed Mahmoud Chems-Eddin , Badr Feryouch , Hakima Mouanis , Ali Tamoussit

We show that a minimal dynamical system $(X,\mathbb{Z})$ on a compact metric $X$ with mdim$X=d$ admits for every natural $k>d$ an equivariant map to the shift $([0,1]^k)^{\mathbb{Z}}$ such that each fiber of this map contains at most…

Dynamical Systems · Mathematics 2023-12-11 Michael Levin

Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

Computational Complexity · Computer Science 2025-06-24 Dror Chawin , Ishay Haviv

In 1984, K. Mahler asked how well elements in the Cantor middle third set can be approximated by rational numbers from that set, and by rational numbers outside of that set. We consider more general missing digit sets $C$ and construct…

Number Theory · Mathematics 2019-11-11 Damien Roy , Johannes Schleischitz

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Logic in Computer Science · Computer Science 2019-01-18 Ziyuan Gao , Sanjay Jain , Bakhadyr Khoussainov , Wei Li , Alexander Melnikov , Karen Seidel , Frank Stephan

In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\Sigma^*$ where $\Sigma$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct…

Combinatorics · Mathematics 2016-08-16 Gérard Duchamp , Eric Laugerotte , Jean-Gabriel Luque

We use the structure theory of minimal dynamical systems to show that, for a general group $\Gamma$, a tame, metric, minimal dynamical system $(X, \Gamma)$ has the following structure: \begin{equation*} \xymatrix {& \tilde{X} \ar[dd]_\pi…

Dynamical Systems · Mathematics 2018-02-14 Eli Glasner

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

Commutative Algebra · Mathematics 2026-04-22 Ben Blum-Smith , Sylvan Crane , Karla Guzman , Alexis Menenses , Maxine Song-Hurewitz

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Combinatorics · Mathematics 2024-10-23 Martin Bohnert , Justus Springer

Let $\mathcal{M}\subset \mathbb{R}^n$ be a compact and sufficiently smooth manifold of dimension $d$. Suppose $\mathcal{M}$ is nowhere completely flat. Let $N_{\mathcal{M}}(\delta,Q)$ denote the number of rational vectors $\mathbf{a}/q$…

Number Theory · Mathematics 2024-07-29 Damaris Schindler , Rajula Srivastava , Niclas Technau