Search

The Cattle Tracing System database is an online recording system for cattle births, deaths and between--herd movements in the United Kingdom. Although it has been thoroughly examined, the most recently reported movement analysis is from 2009. This article uses the database to construct weighted directed monthly movement networks for two distinct periods of time, 2004--2006 and 2015--2017, to quantify by how much the underlying structure of the network has changed. Substantial changes in network structure may influence policy--makers directly or may influence models built upon the network data, and these in turn could impact policy--makers and their assessment of risk. Four general network measures are used (total number of nodes with movements, movements, births and deaths), in conjunction with network metrics to describe each monthly network. Two updates of the database were examined to determine by how much the movement data stored for a particular time period had been cleansed between updates. Statistical models show that there is a statistically significant effect of the time period (2004--2006 vs 2015--2017) in the values of all network measures and six of nine network metrics. Changes in the sizes of both the Giant and Weakly Strongly Connected components predict reductions in the upper and lower bounds of the maximum epidemic size. Examination of the updates of the database show that there are differences in records between updates and therefore evidence of historical data changing between updates. Accurate modelling of disease spread through a network requires representative descriptions of the network. The authors recommend that where possible the most recent available data always be used for network modelling and that methods of network prediction be examined to mitigate for the time required for data to become available.

We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$ of a partially commutative group $\mathbb{G}$, certain Magnus subgroups embed in the quotient $G=\mathbb{G}/N(r)$; that if $r=s^n$ has root $s$ in $\mathbb{G}$ then the order of $s$ in $G$ is $n$, and under slightly stronger conditions that the word problem of $G$ is decidable. We also give conditions under which the question of which Magnus subgroups of $\mathbb{G}$ embed in $G$ reduces to the same question in the minimal parabolic subgroup of $\mathbb{G}$ containing $r$. In many cases this allows us to characterise Magnus subgroups which embed in $G$, via a condition on $r$ and the commutation graph of $\mathbb{G}$, and to find further examples of quotients $G$ where the word and conjugacy problems are decidable. We give evidence that situations in which our main theorem applies are not uncommon, by proving that for cycle graphs with a chord $\Gamma$, almost all cyclically reduced elements of the partially commutative group $\mathbb{G}(\Gamma)$ satisfy the conditions of the theorem., Comment: 49 pages, 6 figures

The structure of a certain subgroup $S$ of the automorphism group of a partially commutative group (RAAG) $G$ is described in detail: namely the subgroup generated by inversions and elementary transvections. We define admissible subsets of the generators of $G$, and show that $S$ is the subgroup of automorphisms which fix all subgroups $\langle Y\rangle$ of $G$, for all admissible subsets $Y$. A decomposition of $S$ as an iterated tower of semi-direct products in given and the structure of the factors of this decomposition described. The construction allows a presentation of $S$ to be computed, from the commutation graph of $G$., Comment: 36 pages, 2 figures

An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy problem; which although essentially correct fails in certain cases, as we show here. A revised and complete version of the algorithm is written out explicitly. From this, we construct an algorithm for the power conjugacy problem in these groups. Python implementations of these algorithms can be found at [26]., Comment: 58 pages, improved introduction, added pond-orbit illustration and some phrasing improved throughout the paper

We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show how Aut(G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decompostion of Aut(G) into a subgroup of locally conjugating automorphisms by the subgroup stabilising a certain lattice of "admissible subsets" of the vertices of C. We then characterise those graphs for which Aut(G) is a product (not necessarily semi-direct) of two such subgroups., Comment: 7 figures, 63 pages. Notation and definitions clarified and typos corrected. 2 new figures added. Appendix containing details of presentation and proof of a theorem added

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent and then systems in which the length reducing rules lead to geodesics. Combining these properties we arrive at our main object of study which we call geodesically perfect rewriting systems. We show that these are well-behaved and convenient to use, and give several examples of classes of groups for which they can be constructed from natural presentations. We describe a Knuth-Bendix completion process to construct such systems, show how they may be found with the help of Stallings' pregroups and conversely may be used to construct such pregroups., Comment: 44 pages, to appear in "Combinatorial and Geometric Group Theory, Dortmund and Carleton Conferences". Series: Trends in Mathematics. Bogopolski, O.; Bumagin, I.; Kharlampovich, O.; Ventura, E. (Eds.) 2009, Approx. 350 p., Hardcover. ISBN: 978-3-7643-9910-8 Birkhauser

The linear strong--property--fluctuation theory (SPFT) was developed in order to estimate the constitutive parameters of certain homogenized composite materials (HCMs) in the long--wavelength regime. The component materials of the HCM were generally orthorhombic $mm2$ piezoelectric materials, which were randomly distributed as oriented ellipsoidal particles. At the second--order level of approximation, wherein a two--point correlation function and its associated correlation length characterize the component material distributions, the SPFT estimates of the HCM constitutive parameters were expressed in terms of numerically--tractable two--dimensional integrals. Representative numerical calculations revealed that: (i) the lowest--order SPFT estimates are qualitatively similar to those provided by the corresponding Mori--Tanaka homogenization formalism, but differences between the two estimates become more pronounced as the component particles become more eccentric in shape; and (ii) the second--order SPFT estimate provides a significant correction to the lowest--order estimate, which reflects dissipative losses due to scattering.

The strong-property-fluctuation theory (SPFT) provides a general framework for estimating the constitutive parameters of a homogenized composite material (HCM). We developed the elastodynamic SPFT for orthotropic HCMs, in order to undertake numerical studies. A specific choice of two-point covariance function - which characterizes the distributional statistics of the generally ellipsoidal particles that constitute the component materials - was implemented. Representative numerical examples revealed that the lowest-order SPFT estimate of the HCM stiffness tensor is qualitatively similar to the estimate provided by the Mori-Tanaka mean-field formalism, but the differences between the two estimates vary as the orthotropic nature of the HCM is accentuated. The second-order SPFT provides a correction to the lowest-order estimate of the HCM stiffness tensor and density. The correction, indicating effective dissipation due to scattering loss, increases as the HCM becomes less orthotropic but decreases as the correlation length becomes smaller.

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup $St(L(G))$, represented as a subgroup of $GL(n,Z)$, where $n$ is the number of vertices of the graph $\Gamma$. In the last section of the paper we give a description of the decomposition of the group of automorphisms $St^{conj}(L(G))$ as a semidirect product of the group of conjugating automorphisms $Conj(G)$ and $St(L(G))$. This result is closely related to Theorem 1.4 of the paper arXiv:0710.2573v1., Comment: 24 pages, 1 figure

We adapt the Deutsch-Josza algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output, with the introduction of a more general concept of parity. We provide examples in which properties of the algorithm allow to reduce the number of oracle queries with respect to the deterministic classical case. This has some consequences for the word problem in groups with a particular kind of presentation., Comment: 14 pages, 2 EPS figure

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially commutative groups (or right-angled Artin groups). In this paper we construct orthogonality theory for graphs with the study of partially commutative groups in mind. The theory developed here provides tools for the study of the structure of the centraliser lattice of partially commutative groups and for their automorphism groups., Comment: 38 pages, 6 figures

The Bergman-Milton bounds provide limits on the effective permittivity of a composite material comprising two isotropic dielectric materials. These provide tight bounds for composites arising from many conventional materials. We reconsider the Bergman-Milton bounds in light of the recent emergence of metamaterials, in which unconventional parameter ranges for relative permittivities are encountered. Specifically, it is demonstrated that: (a) for nondissipative materials the bounds may be unlimited if the constituent materials have relative permittivities of opposite signs; (b) for weakly dissipative materials characterized by relative permittivities with real parts of opposite signs, the bounds may be exceedingly large.

Exponential equations in free groups were studied initially by Lyndon and Schutzenberger and then by Comerford and Edmunds. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential equations have solution is decidable, in finitely generated free groups. In this paper we show that for finite systems of quadratic exponential equations decidability passes, under certain hypotheses, from the factor groups to free products and one-relator products., Comment: 140 pages, 94 figures

In a previous paper we investigated the centraliser dimension of groups. In the current paper we study properties of centraliser dimension for the class of free partially commutative groups and, as a corollary, we obtain an efficient algorithm for computation of centraliser dimension in these groups., Comment: 30 pages, 5 figures Corrections following the referee's report and correcting mistakes in Section 2

Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch--Jozsa--Hoyer algorithm) can in fact deal with a broader range of promises, which we define in terms of the irreducible representations of G., Comment: 24 pages, 5 figures, to appear in LMS JCM Updated on 9th August 2005 following the referees comments. Added: Overview of questions surrounding the Fourier transform; Appendix on group representations. Corrected typos and improved notation

We present a survey of quantum algorithms, primarily for an intended audience of pure mathematicians. We place an emphasis on algorithms involving group theory., Comment: To appear in "Interactions Between Logic, Group Theory and Computer Science", AMS Contemporary Math. Replaced with reformated references