Related papers: Non-Expansive Matrix Based number Systems

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

Let $G=C_n\oplus C_n$ and let $k\in [0,n-1]$. We study the structure of sequences of terms from $G$ with maximal length $|S|=2n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $2n-1-k$. For $k\leq 1$, this is…

Let $\D_{v,b,k}$ denote the family of all connected block designs with $v$ treatments and $b$ blocks of size $k$. Let $d\in\D_{v,b,k}$. The replication of a treatment is the number of times it appears in the blocks of $d$. The matrix…

Let G be a simple simple-connected exceptional algebraic group of type G_2, F_4, E_6 or E_7 over an algebraically closed field k of characteristic p>0 with \g=Lie(G). For each nilpotent orbit G.e of \g, we list the Jordan blocks of the…

Let $V$ be a finite-dimensional vector space over a field of characteristic two. As the main result of this paper, for every nilpotent element $e \in \mathfrak{sl}(V)$, we describe the Jordan normal form of $e$ on the…

In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: \[(\lambda \cdot I-A) \cdot B(\lambda)=P(\lambda) \cdot I\] where $B(\lambda)$ is $(\lambda \cdot I-A)$'s comatrix and $P(\lambda)$ is $A$'s…

We show that for a polynomial map, the size of the Jordan blocks for the eigenvalue 1 of the monodromy at infinity is bounded by the multiplicity of the reduced divisor at infinity of a good compactification of a general fiber. The…

In this paper, we study bounds on the minimum length of $(k,n,d)$-superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with runlength constraints. A $(k,n,d)$-superimposed code of…

Let $\Psi$ be a system of linear forms with finite complexity. In their seminal paper, Green and Tao showed the following prime number theorem for values of the system $\Psi$: $$\sum_{x\in [-N,N]^d} \prod_{i=1}^t…

Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

We consider infinite quasi-periodic Jacobi self-adjoint matrices for which the three main diagonals are given via values of real analytic functions on the trajectory of the shift $x\rightarrow x+\omega$. We assume that the Lyapunov exponent…

We describe the complete set of pairwise non-isomorphic irreducible modules S(a) over the algebra R given by the defining relation xy-yx=yy, and the rule how they could be glued to indecomposables. Namely, we show that Ext_k^1(S(a),S(b))=0,…

Dual complex matrices have found applications in brain science. There are two different definitions of the dual complex number multiplication. One is noncommutative. Another is commutative. In this paper, we use the commutative definition.…

Multicomponent KdV-systems are defined in terms of a set of structure constants and, as shown by Svinolupov, if these define a Jordan algebra the corresponding equations may be said to be integrable, at least in the sense of having…

We construct an L^2-model of "very small" irreducible unitary representations of simple Lie groups G which, up to finite covering, occur as conformal groups Co(V) of simple Jordan algebras V. If $V$ is split and G is not of type A_n, then…

The spectral properties of two special classes of Jacobi operators are studied. For the first class represented by the $2M$-dimensional real Jacobi matrices whose entries are symmetric with respect to the secondary diagonal, a new…

In this paper we prove that the SNIEP $\neq$ DNIEP, i.e. the symmetric and diagonalizable nonnegative inverse eigenvalue problems are different. We also show that the minimum $t>0$ for which $(3+t,3-t,-2,-2,-2)$ is realizable by a…

In an instance of the minimum eigenvalue problem, we are given a collection of $n$ vectors $v_1,\ldots, v_n \subset {\mathbb{R}^d}$, and the goal is to pick a subset $B\subseteq [n]$ of given vectors to maximize the minimum eigenvalue of…

We find a construction that expresses any tree-level $n$-particle ${\rm N^{k-2}MHV}$ color-ordered partial amplitude in gauge theory as a linear combination of a basis of dimension $\eulerian{n-3}{k-2}$. Here $\eulerian{p}{q}$ denotes the…