Related papers: Interval matrices: realization of ranks by rationa…

Allen's Interval Algebra constitutes a framework for reasoning about temporal information in a qualitative manner. In particular, it uses intervals, i.e., pairs of endpoints, on the timeline to represent entities corresponding to actions,…

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parameterized, well-founded relations such that an assignment to…

This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…

Let $f(x)=x^5+ax^3+bx^2+cx \in \Z[x]$ and consider the hypersurface of degree five given by the equation \cal{V}_{f}: f(p)+f(q)=f(r)+f(s). Under the assumption $b\neq 0$ we show that there exists $\Q$-unirational elliptic surface contained…

We give a rational form of a generic two-dimensional "quad" map, containing the so-called $Q_4$ case, but whose coefficients are free. Its integrability is proved using the calculation of algebraic entropy.

A sign pattern matrix is a matrix whose entries are from the set $\{+,-,0\}$. If $A$ is an $m\times n$ sign pattern matrix, the qualitative class of $A$, denoted $Q(A)$, is the set of all real $m\times n$ matrices $B=[b_{i,j}]$ with…

We consider supervised learning problems within the positive-definite kernel framework, such as kernel ridge regression, kernel logistic regression or the support vector machine. With kernels leading to infinite-dimensional feature spaces,…

In this paper we will find a matrix realizations of the quantum group g_{p, q}. For this purpose, we construct all primitive idempotents and a basis of g_{p, q}. We determine the action of elements of the basis on the indecomposable…

We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the…

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…

In this paper, we consider rational functions $f$ with some minor restrictions over the finite field $\mathbb{F}_{q^n},$ where $q=p^k$ for some prime $p$ and positive integer $k$. We establish a sufficient condition for the existence of a…

Given a prime power $q$ and an integer $n\geq2$, we establish a sufficient condition for the existence of a primitive pair $(\alpha,f(\alpha))$ where $\alpha \in \mathbb{F}_q$ and $f(x) \in \mathbb{F}_q(x)$ is a rational function of degree…

To r ideals on a germ of smooth variety X one attaches a rational polytope in the r-dimensional Euclidean space (the LCT-polytope) that generalizes the notion of log canonical threshold in the case of one ideal. We study these polytopes,…

We show any matrix of rank $r$ over $\mathbb{F}_q$ can have $\leq \binom{r}{k}(q-1)^k$ distinct columns of weight $k$ if $ k \leq O_q(\sqrt{\log r})$ (up to divisibility issues), and $\leq \binom{r}{k}(q-1)^{r-k}$ distinct columns of…

We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

We consider one-dimensional cellular automata $F_{p,q}$ which multiply numbers by $p/q$ in base $pq$ for relatively prime integers $p$ and $q$. By studying the structure of traces with respect to $F_{p,q}$ we show that for $p\geq 2q-1$ (and…