English
Related papers

Related papers: On positional representation of integer vectors

200 papers

Let $z_{1},z_{2},...,z_{N}$ be a sequence of distinct grid points. A finite difference formula approximates the $m$-th derivative $f^{(m)}(0)$ as $\sum w_{k}f(z_{k})$, with $w_{k}$ being the weights. We derive an algorithm for finding the…

Numerical Analysis · Mathematics 2014-08-28 Burhan Sadiq , Divakar Viswanath

In [Mulmuley, 1987], Mulmuley gave an algorithm reducing the computation of the matrix rank function to that of determinants, of which the proof for the verification is elementary. In this article, we formalize this argument in the bounded…

Logic in Computer Science · Computer Science 2025-08-20 Eitetsu Ken , Satoru Kuroda

Let $\mathscr{A}$ be a finite set of closed rational points in projective space, let $\mathscr{I}$ be the vanishing ideal of $\mathscr{A}$, and let $\mathscr{D}(\mathscr{A})$ be the set of exponents of those monomials which do not occur as…

Commutative Algebra · Mathematics 2007-11-19 Mathias Lederer

Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…

Combinatorics · Mathematics 2012-03-13 Oriol Serra , Lluís Vena

The Seidel matrix of a tournament on $n$ players is an $n\times n$ skew-symmetric matrix with entries in $\{0, 1, -1\}$ that encapsulates the outcomes of the games in the given tournament. It is known that the determinant of an $n\times n$…

Combinatorics · Mathematics 2024-06-17 Sarah Klanderman , MurphyKate Montee , Andrzej Piotrowski , Alex Rice , Bryan Shader

In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…

Number Theory · Mathematics 2013-10-22 Simone Ugolini

Let $R=K[[x_1,...,x_s]]$ be the ring of formal power series with maximal ideal $\mathfrak{m}$ over a field $K$ of arbitrary characteristic. On the ring $M_{m,n}$ of $m\times n$ matrices $A$ with entries in $R$ we consider several…

Algebraic Geometry · Mathematics 2016-09-19 Gert-Martin Greuel , Thuy Huong Pham

Let $Q$ be a subset of a finite distributive lattice $D$. An algebra $A$ represents the inclusion $Q\subseteq D$ by principal congruences if the congruence lattice of $A$ is isomorphic to $D$ and the ordered set of principal congruences of…

Rings and Algebras · Mathematics 2017-07-03 Gábor Czédli

The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…

Neural and Evolutionary Computing · Computer Science 2012-05-04 Boris Kryzhanovsky , Mikhail Kryzhanovsky , Magomed Malsagov

We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of…

Data Structures and Algorithms · Computer Science 2014-02-17 Markus Lohrey , Manfred Schmidt-Schauss

A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a…

Combinatorics · Mathematics 2007-05-23 Herbert S. Wilf

Let $A$ be an expanding matrix on ${\Bbb R}^s$ with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set ${\mathcal D}\subset{\Bbb Z}^s$ so that the integral self-affine set…

Combinatorics · Mathematics 2013-05-03 Chun-Kit Lai , Ka-Sing Lau , Hui Rao

For points in $d$ real dimensions, we introduce a geometry for general digit sets. We introduce a positional number system where the basis for our representation is a fixed $d$ by $d$ matrix over $\bz$. Our starting point is a given pair…

Number Theory · Mathematics 2008-10-08 Dorin Ervin Dutkay , Palle E. T. Jorgensen , Gabriel Picioroaga

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

Combinatorics · Mathematics 2021-01-27 Akshat Mudgal

Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…

Number Theory · Mathematics 2021-11-11 Lu Cui , Minghui Ma

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. Let $\mathcal{N}_K$ be the set of positive integers $n$ such that there exist units $\varepsilon, \delta \in \mathcal{O}_K^\times$ satisfying $\varepsilon + \delta = n$. We…

Number Theory · Mathematics 2026-05-12 Magdaléna Tinková , Robin Visser , Pavlo Yatsyna

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

Let $f\colon X\to Y$ be a $\sigma$-perfect $k$-dimensional surjective map of metrizable spaces such that $\dim Y\leq m$. It is shown that, for every positive integer $p\geq 1$ there exists a dense $G_{\delta}$-subset ${\mathcal H}(k,m,p)$…

General Topology · Mathematics 2007-05-23 H. Murat Tuncali , Vesko Valov

If $D$ is a partially filled-in $(0,1)$-matrix with a unique completion to a $(0,1)$-matrix $M$ (with prescribed row and column sums), we say that $D$ is a {\em defining set} for $M$. A {\em critical set} is a minimal defining set (the…

Combinatorics · Mathematics 2018-12-21 Nicholas J. Cavenagh , Liam K. Wright