352,748 research outputs found
On equations over sets of integers
Systems of equations with sets of integers as unknowns are considered. It is
shown that the class of sets representable by unique solutions of equations
using the operations of union and addition S+T=\makeset{m+n}{m \in S, \: n \in
T} and with ultimately periodic constants is exactly the class of
hyper-arithmetical sets. Equations using addition only can represent every
hyper-arithmetical set under a simple encoding. All hyper-arithmetical sets can
also be represented by equations over sets of natural numbers equipped with
union, addition and subtraction S \dotminus T=\makeset{m-n}{m \in S, \: n \in
T, \: m \geqslant n}. Testing whether a given system has a solution is
-complete for each model. These results, in particular, settle the
expressive power of the most general types of language equations, as well as
equations over subsets of free groups.Comment: 12 apges, 0 figure
Introduction to a Quantum Theory over a Galois Field
We consider a quantum theory based on a Galois field. In this approach
infinities cannot exist, the cosmological constant problem does not arise, and
one irreducible representation (IR) of the symmetry algebra splits into
independent IRs describing a particle an its antiparticle only in the
approximation when de Sitter energies are much less than the characteristic of
the field. As a consequence, the very notions of particles and antiparticles
are only approximate and such additive quantum numbers as the electric, baryon
and lepton charges are conserved only in this approximation. There can be no
neutral elementary particles and the spin-statistics theorem can be treated
simply as a requirement that standard quantum theory should be based on complex
numbers.Comment: 43 pages, Latex, 1 figur
Partition regularity without the columns property
A finite or infinite matrix A with rational entries is called partition
regular if whenever the natural numbers are finitely coloured there is a
monochromatic vector x with Ax=0. Many of the classical theorems of Ramsey
Theory may naturally be interpreted as assertions that particular matrices are
partition regular. In the finite case, Rado proved that a matrix is partition
regular if and only it satisfies a computable condition known as the columns
property. The first requirement of the columns property is that some set of
columns sums to zero.
In the infinite case, much less is known. There are many examples of matrices
with the columns property that are not partition regular, but until now all
known examples of partition regular matrices did have the columns property. Our
main aim in this paper is to show that, perhaps surprisingly, there are
infinite partition regular matrices without the columns property --- in fact,
having no set of columns summing to zero.
We also make a conjecture that if a partition regular matrix (say with
integer coefficients) has bounded row sums then it must have the columns
property, and prove a first step towards this.Comment: 13 page
- …