English
Related papers

Related papers: On positional representation of integer vectors

200 papers

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $q$ is an integer, let $B_{q,d,m}(g)$ be the set of all lines $\Pi^d\subset\mathbb R^m$ such that $|g^{-1}(\Pi^d)|\geq q$. Let also $\mathcal H(q,d,m,k)$ denote the maps $g\colon…

General Topology · Mathematics 2010-11-09 S. Bogataya , S. Bogatyi , V. Valov

A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…

Group Theory · Mathematics 2007-05-23 Gábor Braun

A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…

Combinatorics · Mathematics 2017-03-17 Sourav Kanti Patra , Swapan Kumar Ghosh

Idempotent elements are a well-studied part of ring theory, with several identities of the idempotents in $\mathbb{Z}/m\mathbb{Z}$ already known. Although the idempotents are not closed under addition, there are still interesting additive…

Rings and Algebras · Mathematics 2020-05-12 Kelly Isham , Laura Monroe

Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…

Computational Complexity · Computer Science 2016-06-30 Martin Dyer , Leslie Ann Goldberg , David Richerby

We define radix representations for vectors in Z^n analogously with radix representations in Z, and give a sufficient condition for a matrix A:Z^n -> Z^n to yield a radix representation with a given canonical digit set. We relate our…

Number Theory · Mathematics 2010-02-23 Eva Curry

Let $\mathcal X$ be an infinite locally compact separable metric space with metric $\rho$ and let $f : \mathcal X \longrightarrow \mathcal X$ be a continuous weakly mixing map. Let $\beta = \sup \big\{ \rho(x, y): \{x, y \} \subset \mathcal…

Dynamical Systems · Mathematics 2020-03-17 Bau-Sen Du

Let $A$ be an expanding $2 \times 2$ matrix with rational entries and $\mathbb{Z}^2[A]$ be the smallest $A$-invariant $\mathbb{Z}$-module containing $\mathbb{Z}^2$. Let $\mathcal{D}$ be a finite subset of $\mathbb{Z}^2[A]$ which is a…

Number Theory · Mathematics 2025-07-09 Anjelo Gabriel R. Cruz , Manuel Joseph C. Loquias , Jörg M. Thuswaldner

Let $\mathbb{F}_q$ be an arbitrary finite field of order $q$. In this article, we study $\det S$ for certain types of subsets $S$ in the ring $M_2(\mathbb F_q)$ of $2\times 2$ matrices with entries in $\mathbb F_q$. For $i\in \mathbb{F}_q$,…

Combinatorics · Mathematics 2019-04-17 Daewoong Cheong , Doowon Koh , Thang Pham , Anh Vinh Le

Let $A \in \mathbb{Z}^{m \times n}$ be an integer matrix with components bounded by $\Delta$ in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix $B \in \mathbb{Z}^{m' \times n}$ with the following property:…

Computational Complexity · Computer Science 2025-10-21 Friedrich Eisenbrand , Thomas Rothvoss

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

Combinatorics · Mathematics 2024-01-01 Luca Ferrarini , Samuel Fiorini , Stefan Kober , Yelena Yuditsky

We continue the Coxeter spectral analysis of finite connected posets $I$ that are non-negative in the sense that their symmetric Gram matrix $G_I:=\frac{1}{2}(C_I + C_I^{tr})\in\mathbb{M}_{m}(\mathbb{Q})$ is positive semi-definite of rank…

Discrete Mathematics · Computer Science 2023-03-24 M. Gąsiorek

We study representations of integral vectors in a number system with a matrix base $M$ and vector digits. We focus on the case when $M$ is similar to $J_n$, the Jordan block of $1$ of size $n$. If $M=J_2$, we classify digit sets of size 2…

Number Theory · Mathematics 2021-10-25 Joshua W. Caldwell , Kevin G. Hare , Tomáš Vávra

Let $\beta \equiv \{ \beta_\mathbf{i} \}_{\mathbf{i} \in \mathbb{Z}_+^d}$ be a $d$-dimensional multisequence. Curto and Fialkow, have shown that if the infinite moment matrix $M(\beta)$ is finite-rank positive semidefinite, then $\beta$ has…

Functional Analysis · Mathematics 2016-10-13 Kaissar Idrissi , El Hassan Zerouali

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…

Quantum Physics · Physics 2013-09-25 Joohan Na

Let $[a,b]$ denote the integers between $a$ and $b$ inclusive and, for a finite subset $X \subseteq \mathbb{Z}$, let the diameter of $X$ be equal to $\max(X)-\min(X)$. We write $X<_p\,Y$ provided $\max(X)<\min(Y)$. For a positive integer…

Combinatorics · Mathematics 2014-07-22 Daniel Bernstein , David J. Grynkiewicz , Carl R. Yerger

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let representation function $R_{A}(\overline{n})$ denote the number of…

Number Theory · Mathematics 2020-07-01 Cui-Fang Sun , Meng-Chi Xiong

In this paper we solve in the positive the question of whether any finite set of integers, containing the zero, is the mapping degree set between two oriented closed connected manifolds of the same dimension. We extend this question to the…

Geometric Topology · Mathematics 2024-09-17 Cristina Costoya , Vicente Muñoz , Antonio Viruel

The support of a vector is the number of nonzero-components. We show that given an integral $m\times n$ matrix $A$, the integer linear optimization problem $\max\left\{\boldsymbol{c}^T\boldsymbol{x} : A\boldsymbol{x} = \boldsymbol{b}, \,…

Optimization and Control · Mathematics 2017-12-27 Iskander Aliev , Jesus De Loera , Fritz Eisenbrand , Timm Oertel , Robert Weismantel