Related papers: Jet Schemes of the Commuting Matrix Pairs Scheme

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

Let K be a number field, let f: P_1 --> P_1 be a nonconstant rational map of degree greater than 1, let S be a finite set of places of K, and suppose that u, w in P_1(K) are not preperiodic under f. We prove that the set of (m,n) in N^2…

We prove that if $k$ is a positive integer then for every finite field $\mathbb{F}$ of cardinality $q\neq 2$ and for every positive integer $n$ such that $q^n>(k-1)^4$, every $n\times n$ matrix over $\mathbb{F}$ can be expressed as a sum of…

We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

Denote by $w(T)$ the numerical radius of a matrix $T$. An elementary proof is given to the fact that $w(AB) \leq w(A)w(B)$ for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

Kempf proved that the theta divisor of a smooth projective curve C has rational singularities. In this paper we estimate the dimensions of the jet schemes of the theta divisor and show that all these schemes are irreducible. In particular,…

We show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…

A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…

Let $n\geq k\geq 2$ be two integers and $S$ a subset of $\{0,1,\dots,k-1\}$. The graph $J_{S}(n,k)$ has as vertices the $k$-subsets of the $n$-set $[n]=\{1,\dots,n\}$ and two $k$-subsets $A$ and $B$ are adjacent if $|A\cap B|\in S$. In this…

The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of…

We prove that for all integers $k \geq 1$, there exists a constant $C_k$ depending only on $k$, such that for all $q > C_k$, and for $n = 1, 2$ every matrix in $M_n(\mathbb{F}_q)$ is a sum of two $k$th powers and for all $n \geq 3$ every…

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Let G be a simple complex algebraic group and let K be a reductive subgroup of G such that the coordinate ring of G/K is a multiplicity free G-module. We consider the G-algebra structure of C[G/K], and study the decomposition into…

A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is…

This work provides a unified formalism for studying difference and (Hasse-) differential algebraic geometry, by introducing a theory of "iterative Hasse rings and schemes". As an application, Hasse jet spaces are constructed generally,…