Related papers: On Finite Racks and Quandles

In this paper we study some algebraic properties of the rack structure as well as the representation theory of it, following the ideas given by M. Elhamdadi and E. M. Moutuou in \cite{Elhamdadi}. We establish a correspondence between the…

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

A birack is an algebraic structure with axioms encoding the blackboard-framed Reidemeister moves, incorporating quandles, racks, strong biquandles and semiquandles as special cases. In this paper we extend the counting invariant for finite…

We study the structure of symplectic quandles, quandles which are also R-modules equipped with an antisymmetric bilinear form. We show that every finite dimensional symplectic quandle over a finite field F or arbitrary field F of…

We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

We study finite morphisms of varieties and the link between their top multiplicity loci under certain assumptions. More precisely, we focus on how to determine that link in terms of the spaces of arcs of the varieties.

Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence…

We define a two-variable polynomial invariant of finite quandles. In many cases this invariant completely determines the algebraic structure of the quandle up to isomorphism. We use this polynomial to define a family of link invariants…

We study special systems with infinitely many degrees of freedom with regard to dynamical evolution and fulfillment of constraint conditions. Attention is focused on establishing a meaningful functional framework, and for that purpose,…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.

This paper has partially a novel and partially a survey character. We start with a short review of rack (two term) homology of self distributive algebraic structures (shelves) and their connections to knot theory. We concentrate on a…

We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…

We establish a connection between finite fields and finite dynamical systems. We show how this connection can be used to shed light on some problems in finite dynamical systems and in particular, in linear systems.

We study rack polynomials and the link invariants they define. We show that constant action racks are classified by their generalized rack polynomials and show that $ns^at^a$-quandles are not classified by their generalized quandle…

In this paper, we explore the algebraic structure of GL-racks, and demonstrate that finite GL-racks decompose canonically into permutation GL-racks and block GL-racks. As a corollary, we verify that two Legendrian knots with the same…

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks.…