Searcharxiv⌕ Search

arXiv subjects

Paul Martin

Publications and source records attributed to Paul Martin.

At least 37 records · Page 2Linked to original sources

Lattice N=4 three-dimensional super-Yang-Mills

We describe our recent work on the lattice formulation of N=4 three-dimensional super-Yang-Mills. Our formulation was based on the Donaldson-Witten twist, but we have also been studying the formulation based on the Blau-Thompson twist by Joseph. We find in the latter case there is a single counterterm necessary to restore supersymmetry in the continuum limit, and that this counterterm can be computed with a two-loop calculation in lattice perturbation theory. It is crucial that this three-dimensional model is super-renormalizable. We also describe some of the motivations for studying three-dimensional theories, including mirror symmetry and holographic cosmology.

hep-lat↗

A presentation for the symplectic blob algebra

The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with $n$. For each $b_n$ we define an algebra by presentation, such that the number of generators and relations grows linearly with $n$. We prove that these algebras are isomorphic.

math.RT↗

Higher lattices, discrete two-dimensional holonomy and topological phases in (3+1) D with higher gauge symmetry

Higher gauge theory is a higher order version of gauge theory that makes possible the definition of 2-dimensional holonomy along surfaces embedded in a manifold where a gauge 2-connection is present. In this paper, we will continue the study of Hamiltonian models for discrete higher gauge theory on a lattice decomposition of a manifold. In particular, we show that a previously proposed construction for higher lattice gauge theory is well-defined, including in particular a Hamiltonian for topological phases of matter in 3+1 dimensions. Our construction builds upon the Kitaev quantum double model, replacing the finite gauge connection with a finite gauge 2-group 2-connection. Our Hamiltonian higher lattice gauge theory model is defined on spatial manifolds of arbitrary dimension presented by slightly {\it combinatorialised} CW-decompositions (2-lattice decompositions), whose 1-cells and 2-cells carry discrete 1-dimensional and 2-dimensional holonomy data. We prove that the ground-state degeneracy of Hamiltonian higher lattice gauge theory is a topological invariant of manifolds, coinciding with the number of homotopy classes of maps from the manifold to the classifying space of the underlying gauge 2-group. The operators of our Hamiltonian model are closely related to discrete 2-dimensional holonomy operators for discretised 2-connections on manifolds with a 2-lattice decomposition. We therefore address the definition of discrete 2-dimensional holonomy for surfaces embedded in 2-lattices. Several results concerning the well-definedness of discrete 2-dimensional holonomy, and its construction in a combinatorial and algebraic topological setting are presented.

math-ph↗

D-SLATS: Distributed Simultaneous Localization and Time Synchronization

Through the last decade, we have witnessed a surge of Internet of Things (IoT) devices, and with that a greater need to choreograph their actions across both time and space. Although these two problems, namely time synchronization and localization, share many aspects in common, they are traditionally treated separately or combined on centralized approaches that results in an ineffcient use of resources, or in solutions that are not scalable in terms of the number of IoT devices. Therefore, we propose D-SLATS, a framework comprised of three different and independent algorithms to jointly solve time synchronization and localization problems in a distributed fashion. The First two algorithms are based mainly on the distributed Extended Kalman Filter (EKF) whereas the third one uses optimization techniques. No fusion center is required, and the devices only communicate with their neighbors. The proposed methods are evaluated on custom Ultra-Wideband communication Testbed and a quadrotor, representing a network of both static and mobile nodes. Our algorithms achieve up to three microseconds time synchronization accuracy and 30 cm localization error.

cs.LG↗

On quasi-heredity and cell module homomorphisms in the symplectic blob algebra

This paper reports key advances in the study of the representation theory of the symplectic blob algebra. For suitable specialisations of the parameters we construct four large families of homomorphisms between cell modules. We hence find a large family of non-semisimple specialisations. We find a minimal poset (i.e. least number of relations) for the symplectic blob as a quasi-hereditary algebra.

math.RT↗

Fiat categorification of the symmetric inverse semigroup IS_n and the semigroup F^*_n

Starting from the symmetric group $S_n$, we construct two fiat $2$-categories. One of them can be viewed as the fiat "extension" of the natural $2$-category associated with the symmetric inverse semigroup (considered as an ordered semigroup with respect to the natural order). This $2$-category provides a fiat categorification for the integral semigroup algebra of the symmetric inverse semigroup. The other $2$-category can be viewed as the fiat "extension" of the $2$-category associated with the maximal factorizable subsemigroup of the dual symmetric inverse semigroup (again, considered as an ordered semigroup with respect to the natural order). This $2$-category provides a fiat categorification for the integral semigroup algebra of the maximal factorizable subsemigroup of the dual symmetric inverse semigroup.

math.RA↗

EmbedInsight: Automated Grading of Embedded Systems Assignments

Grading in embedded systems courses typically requires a face-to-face appointment between the student and the instructor because of experimental setups that are only available in laboratory facilities. Such a manual grading process is an impediment to both students and instructors. Students have to wait for several days to get feedback, and instructors may spend valuable time evaluating trivial aspects of the assignment. As seen with software courses, an automated grading system can significantly improve the insights available to the instructor and encourage students to learn quickly with iterative testing. We have designed and implemented EmbedInsight, an automated grading system for embedded system courses that accommodates a wide variety of experimental setups and is scalable to MOOC-style courses. EmbedInsight employs a modular web services design that separates the user interface and the experimental setup that evaluates student assignments. We deployed and evaluated EmbedInsight for our university embedded systems course. We show that our system scales well to a large number of submissions, and students are satisfied with their overall experience.

cs.CY↗

Topological phases from higher gauge symmetry in 3+1D

We propose an exactly solvable Hamiltonian for topological phases in $3+1$ dimensions utilising ideas from higher lattice gauge theory, where the gauge symmetry is given by a finite 2-group. We explicitly show that the model is a Hamiltonian realisation of Yetter's homotopy 2-type topological quantum field theory whereby the groundstate projector of the model defined on the manifold $M^3$ is given by the partition function of the underlying topological quantum field theory for $M^3\times [0,1]$. We show that this result holds in any dimension and illustrate it by computing the ground state degeneracy for a selection of spatial manifolds and 2-groups. As an application we show that a subset of our model is dual to a class of Abelian Walker-Wang models describing $3+1$ dimensional topological insulators.

cond-mat.str-el↗

On central idempotents in the Brauer algebra

We provide a method for constructing central idempotents in the Brauer algebra relating to the splitting of certain short exact sequences. We also determine some of the primitive central idempotents, and relate properties of the idempotents to known facts about the representation theory of the algebra.

math.RT↗

From tensor category to Temperley-Lieb algebra representation

We construct a representation of the Temperley-Lieb algebra from a multiplicity-free semisimple monoidal Abelian category ${\cal C}$, with two simple objects $λ$ and $ν$ such that $λ\otimesν$ is simple and Hom$_{\cal C}(λ\otimes λ, ν)$ is not empty. A self-contained manual to tensor categories is also provided as well as a summary of the best known example of the construction: Schur-Weyl duality for $U_q(sl_2))$.

math.QA↗

Attack Resilience and Recovery using Physical Challenge Response Authentication for Active Sensors Under Integrity Attacks

Embedded sensing systems are pervasively used in life- and security-critical systems such as those found in airplanes, automobiles, and healthcare. Traditional security mechanisms for these sensors focus on data encryption and other post-processing techniques, but the sensors themselves often remain vulnerable to attacks in the physical/analog domain. If an adversary manipulates a physical/analog signal prior to digitization, no amount of digital security mechanisms after the fact can help. Fortunately, nature imposes fundamental constraints on how these analog signals can behave. This work presents PyCRA, a physical challenge-response authentication scheme designed to protect active sensing systems against physical attacks occurring in the analog domain. PyCRA provides security for active sensors by continually challenging the surrounding environment via random but deliberate physical probes. By analyzing the responses to these probes, and by using the fact that the adversary cannot change the underlying laws of physics, we provide an authentication mechanism that not only detects malicious attacks but provides resilience against them. We demonstrate the effectiveness of PyCRA through several case studies using two sensing systems: (1) magnetic sensors like those found wheel speed sensors in robotics and automotive, and (2) commercial RFID tags used in many security-critical applications. Finally, we outline methods and theoretical proofs for further enhancing the resilience of PyCRA to active attacks by means of a confusion phase---a period of low signal to noise ratio that makes it more difficult for an attacker to correctly identify and respond to PyCRA's physical challenges. In doing so, we evaluate both the robustness and the limitations of PyCRA, concluding by outlining practical considerations as well as further applications for the proposed authentication mechanism.

cs.CR↗

Local representations of the loop braid group

We study representations of the loop braid group $LB_n$ from the perspective of extending representations of the braid group $B_n$. We also pursue a generalization of the braid/Hecke/Temperlely-Lieb paradigm---uniform finite dimensional quotient algebras of the loop braid group algebras.

math.QA↗

On the representation theory of partial Brauer algebras

In this paper we study the partial Brauer $\mathbb{C}$-algebras $\mathfrak{R}_n(δ,δ')$, where $n \in \mathbb{N}$ and $δ,δ'\in\mathbb{C}$. We show that these algebras are generically semisimple, construct the Specht modules and determine the Specht module restriction rules for the restriction $\mathfrak{R}_{n-1} \hookrightarrow \mathfrak{R}_n$. We also determine the corresponding decomposition matrix, and the Cartan decomposition matrix.

math.RT↗

Tiling bijections between paths and Brauer diagrams

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the two-dimensional integer lattice. We show that there is a natural bijection, extending the above tiling construction, between overhang paths and basis diagrams of the Brauer algebra.

math.CO↗

Partitioned binary relations

We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented) Temperley-Lieb diagrams. We construct a one-parameter deformation of the category of partitioned binary relations and show that it gives rise to classical one-parameter deformations of partition, Brauer and Temperley-Lieb categories. Finally, we describe a factorization of partitioned binary relations into a product of certain idempotents and pairs of usual binary relations.

math.RT↗

Alcove geometry and a translation principle for the Brauer algebra

There are similarities between algebraic Lie theory and a geometric description of the blocks of the Brauer algebra in characteristic zero. Motivated by this, we study the alcove geometry of a certain reflection group action. We provide analogues of translation functors for a tower of recollement, and use these to construct Morita equivalences between blocks containing weights in the same facet. Moreover, we show that the determination of decomposition numbers for the Brauer algebra in characteristic zero can be reduced to a study of the block containing the weight 0. We define parabolic Kazhdan-Lusztig polynomials for the Brauer algebra and show in certain low rank examples that they determine standard module decomposition numbers and filtrations.

math.RT↗

On the blocks of the walled Brauer algebra

We determine the blocks of the walled Brauer algebra in characteristic zero. These can be described in terms of orbits of the action of a Weyl group of type $A$ on a certain set of weights. In positive characteristic we give a linkage principle in terms of orbits of the corresponding affine Weyl group. We also classify the semisimple walled Brauer algebras in all characteristics.

math.RT↗