Related papers: Duality for image and kernel partition regularity …
The completeness of quantum state space, is usually expressed as \sum_{m=0}^{\infty}|m><m|=1, where {|m>} is selected set of quantum states (basis). Density matrix |m><m| describes a pure quantum state. In this paper, by virtue of the…
We argue that the finiteness of quantum gravity amplitudes in fully compactified theories (at least in supersymmetric cases) leads to a bottom-up prediction for the existence of non-trivial dualities. In particular, finiteness requires the…
We colour every point x of a probability space X according to the colours of a finite list x_1, ...., x_k of points such that each of the x_i, as a function of x, is a measure preserving transformation. We ask two questions about a…
Hindman's finite sums theorem states that in any finite coloring of the naturals, there is an infinite sequence all of whose finite subset sums are the same color. In 1979, Hindman showed that there is a finite coloring of the naturals so…
Constructing partitions of colored points is a well-studied problem in discrete and computational geometry. We study the problem of creating a minimum-cardinality partition into monochromatic islands. Our input is a set $S$ of $n$ points in…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
This article investigates the two-parameter quantum matrix algebra at roots of unity. In the roots of unity setting, this algebra becomes a Polynomial Identity (PI) algebra and it is known that simple modules over such algebra are…
An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…
Inspired by Owings's problem, we investigate whether, for a given an Abelian group $G$ and cardinal numbers $\kappa,\theta$, every colouring $c:G\longrightarrow\theta$ yields a subset $X\subseteq G$ with $|X|=\kappa$ such that $X+X$ is…
Let $M$ be the $n$-square matrix partitioned into $\ell^2$ blocks $b_{ij}$ according to some partition $P=\{C_{1},\dots,C_{\ell}\}$ of index set $\{1,\dots,n\}$. The quotient matrix $Q=(q_{ij})$ is a $k$-square matrix, with $\ell \leq k…
We show that the pattern $\{x,x+y,xy\}$ is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive bounds. This provides a new proof for the partition…
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of $q$-colorings among graphs with $n$ vertices and $m$ edges. Let $T_r(n)$ denote the Tur\'{a}n graph - the complete…
We present a polyhedral description of kernels in orientations of line multigraphs. Given a digraph $D$, let $FK(D)$ denote the fractional kernel polytope defined on $D$, and let ${\sigma}(D)$ denote the linear system defining $FK(D)$. A…
We give a complete description of the congruences on the partition monoid $P_X$ and the partial Brauer monoid $PB_X$, where $X$ is an arbitrary infinite set, and also of the lattices formed by all such congruences. Our results complement…
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
Given a digraph $D$, we say that a set of vertices $Q\subseteq V(D)$ is a $q$-kernel if $Q$ is an independent set and if every vertex of $D$ can be reached from $Q$ by a path of length at most $q$. In this paper, we initiate the study of…
In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…