English
Related papers

Related papers: Characterization of rational matrices that admit f…

200 papers

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Formal Languages and Automata Theory · Computer Science 2022-05-20 S Akshay , Supratik Chakraborty , Debtanu Pal

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Logic · Mathematics 2017-07-19 Dmytro Taranovsky

For an $n$-by-$n$ complex matrix $A$, we define its zero-dilation index $d(A)$ as the largest size of a zero matrix which can be dilated to $A$. This is the same as the maximum $k$ ($\ge 1$) for which 0 is in the rank-$k$ numerical range of…

Functional Analysis · Mathematics 2013-04-02 Hwa-Long Gau , Kuo-Zhong Wang , Pei Yuan Wu

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

Commutative Algebra · Mathematics 2010-09-09 Sonja Mapes

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

Number Theory · Mathematics 2018-08-23 Hung Chu , Nathan McNew , Steven J. Miller , Victor Xu , Sean Zhang

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

Symbolic Computation · Computer Science 2019-07-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

Given a base $b$, a "digit map" is a map $f: \mathbb{Z}^{\ge 0} \to \mathbb{Z}^{\ge 0}$ of the form $f(\sum_{i=0}^n a_ib^i) = \sum_{i=0}^n f_*(a_i)$, $0 \le a_i \le b-1$ for each $i$, where $f_* : \{0,1,\dots, b-1\} \to \mathbb{Z}^{\ge 0}$…

Number Theory · Mathematics 2020-05-04 Zachary Chase

This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under…

Dynamical Systems · Mathematics 2022-12-20 Alberto Dennunzio , Enrico Formenti , Luciano Margara , Sara Riva

The Zorn's Algebra ZZ(R) has a multiplicative function called determinant with properties similar to the usual one. The set of elements in ZZ(R) with determinant 1 is a Moufang loop that we will denote by \GA. In our main result we prove…

Group Theory · Mathematics 2007-05-23 Fabio Enrique Brochero , Carmen Rosa Giraldo

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

Rings and Algebras · Mathematics 2023-08-31 Flavien Mabilat

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…

Commutative Algebra · Mathematics 2011-04-05 Luis A. Dupont , Carlos Renteria-Marquez , Rafael H. Villarreal

We provide a complete characterization of pairs of full-rank lattices in $\mathbb{R}^{d}$ which admit common connected fundamental domains of the type $N\left[ 0,1\right) ^{d}$ where $N$ is an invertible matrix of order $d.$ Using our…

Metric Geometry · Mathematics 2015-07-17 H. Burgiel , V. Oussa

This paper contains an algebraic constructive and self-contained account of the invariance rule of the digital root under division for an arbitrary natural basis representation. Both the cases of repeating and non-repeating fractionals are…

Number Theory · Mathematics 2021-10-11 Lucas T. Cardoso , Glauber Quadros

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…

Group Theory · Mathematics 2022-04-05 Tobias Hartnick , Stefan Witzel

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

Combinatorics · Mathematics 2016-06-06 Freddie Manners

We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…

High Energy Physics - Theory · Physics 2011-07-19 A. Alexandrov

Let $A$ be an expanding $d\times d$ matrix with integer entries and ${\mathcal D}\subset {\mathbb Z}^d$ be a finite digit set. Then the pair $(A, {\mathcal D})$ defines a unique integral self-affine set $K=A^{-1}(K+{\mathcal D})$. In this…

Geometric Topology · Mathematics 2017-04-25 Jun Jason Luo