English
Related papers

Related papers: Matrices and finite Alexander quandles

200 papers

Carter, Jelsovsky, Kamada, Langford and Saito have defined an invariant of classical links associated to each element of the second cohomology of a finite quandle. We study these invariants for Alexander quandles of the form Z[t,t^{-1}]/(p,…

Geometric Topology · Mathematics 2007-05-23 Richard A. Litherland

We determine when a matrix is similar to a partial isometry, refining a result of Halmos--McLaughlin.

Functional Analysis · Mathematics 2021-02-05 Stephan Ramon Garcia , David Sherman

We provide a technique to find a cluster-tilting object having a given cluster-tilted algebra as endomorphism ring in the finite type case.

Representation Theory · Mathematics 2009-12-16 Marco Angel Bertani-Økland , Steffen Oppermann , Anette Wrålsen

Quandle representations are homomorphisms from a quandle to the group of invertible matrices on some vector space taken with the conjugation operation. We study certain families of quandle representations. More specifically, we introduce…

Representation Theory · Mathematics 2023-07-10 Mohamed Elhamdadi , Prasad Senesi , Emanuele Zappala

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

Combinatorics · Mathematics 2014-04-25 Johannes Carmesin , Reinhard Diestel , Matthias Hamann , Fabian Hundertmark

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…

Data Structures and Algorithms · Computer Science 2007-05-23 Lawrence M. Ioannou

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

Logic in Computer Science · Computer Science 2023-03-31 Miguel Campercholi , Mauricio Tellechea , Pablo Ventura

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…

Quantum Physics · Physics 2009-10-30 Maciej Lewenstein , Anna Sanpera

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

Commutative Algebra · Mathematics 2009-01-08 Anurag K. Singh , Irena Swanson

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…

Geometric Topology · Mathematics 2017-03-20 Zhiqing Yang

This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…

Quantum Algebra · Mathematics 2007-05-23 G. Ehrman , A. Gurpinar , M. Thibault , D. N. Yetter

The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper…

Covariance matrices are a useful tool to investigate correlations and entanglement in quantum systems. They are widely used in continuous variable systems, but recently also for finite dimensional systems powerful entanglement criteria in…

Quantum Physics · Physics 2010-04-22 Oleg Gittsovich , Otfried Gühne

Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…

Symbolic Computation · Computer Science 2018-11-01 Alexander Imani Cowen-Rivers , Matthew England

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Logic in Computer Science · Computer Science 2010-10-15 Marie Ferbus-Zanda , Serge Grigorieff

We present methods of constructing examples of quandles of order 3n, where n is greater or equal to 3. The necessary and sufficient conditions for the constructed examples to be (i) connected (ii) group (conjugate) (iii) involutory and (iv)…

Group Theory · Mathematics 2022-07-18 Abednego Orobosa Isere , Abraham O. Elakhe , Cletus Ugbolo

We show that two Alexander biquandles M and M' are isomorphic iff there is an isomorphism of Z[s,1/s,t,1/t]-modules h:(1-st)M --> (1-st)M' and a bijection g:O_s(A) --> O_s(A') between the s-orbits of sets of coset representatives of…

Quantum Algebra · Mathematics 2011-11-09 Daisy Lam , Sam Nelson

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

Mathematical Physics · Physics 2009-08-18 Giuliana Indelicato

Cochran defined the nth-order integral Alexander module of a knot in the three sphere as the first homology group of the knot's (n+1)th-iterated abelian cover. The case n=0 gives the classical Alexander module (and polynomial). After a…

Geometric Topology · Mathematics 2013-08-20 Peter D. Horn

It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular $2x2$ matrices. In…

Geometric Topology · Mathematics 2009-08-09 Hajer Jebali
‹ Prev 1 3 4 5 6 7 10 Next ›