219 research outputs found

    Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method

    Get PDF
    The current paper deals with the enumeration and classification of the set SORr,n of self-orthogonal r × r partial Latin rectangles based on n symbols. These combinatorial objects are identified with the independent sets of a Hamming graph and with the zeros of a radical zero-dimensional ideal of polynomials, whose reduced Gröbner basis and Hilbert series can be computed to determine explicitly the set SORr,n. In particular, the cardinality of this set is shown for r ≤ 4 and n ≤ 9 and several formulas on the cardinality of SORr,n are exposed, for r ≤ 3. The distribution of r × s partial Latin rectangles based on n symbols according to their size is also obtained, for all r, s, n ≤ 4

    Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by means of a SAT solver

    Get PDF
    Conjugacy and orthogonality of Latin squares have been widely studied in the literature not only for their theoretical interest in combinatorics, but also for their applications in distinct fields as experimental design, cryptography or code theory, amongst others. This paper deals with a series of binary constraints that characterize the sets of partial Latin squares of a given order for which their six conjugates either coincide or are all of them distinct and pairwise orthogonal. These constraints enable us to make use of a SAT solver to enumerate both sets. As an illustrative application, it is also exposed a method to construct totally symmetric partial Latin squares that gives rise, under certain conditions, to new families of Lie partial quasigroup rings

    A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares

    Get PDF
    Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. The robustness and effectiveness of these algorithms are respectively based on the extremely large key space and the appropriate choice of the Latin square under consideration. It is also known the importance that isomorphism classes of Latin squares have to design an effective algorithm. In order to delve into this last aspect, we improve in this paper the efficiency of the known methods on computational algebraic geometry to enumerate and classify partial Latin squares. Particularly, we introduce the notion of affine algebraic set of a partial Latin square L = (lij ) of order n over a field K as the set of zeros of the binomial ideal xi xj − xlij : (i, j) is a non-empty cell inL ⊆ K[x1, . . . , xn]. Since isomorphic partial Latin squares give rise to isomorphic affine algebraic sets, every isomorphism invariant of the latter constitutes an isomorphism invariant of the former. In particular, we deal computationally with the problem of deciding whether two given partial Latin squares have either the same or isomorphic affine algebraic sets. To this end, we introduce a new pair of equivalence relations among partial Latin squares: being partial transpose and being partial isotopic

    Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups

    Get PDF
    An r×sr \times s partial Latin rectangle (lij)(l_{ij}) is an r×sr \times s matrix containing elements of {1,2,,n}{}\{1,2,\ldots,n\} \cup \{\cdot\} such that each row and each column contain at most one copy of any symbol in {1,2,,n}\{1,2,\ldots,n\}. An entry is a triple (i,j,lij)(i,j,l_{ij}) with lijl_{ij} \neq \cdot. Partial Latin rectangles are operated on by permuting the rows, columns, and symbols, and by uniformly permuting the coordinates of the set of entries. The stabilizers under these operations are called the autotopism group and the autoparatopism group, respectively. We develop the theory of symmetries of partial Latin rectangles, introducing the concept of a partial Latin rectangle graph. We give constructions of mm-entry partial Latin rectangles with trivial autotopism groups for all possible autoparatopism groups (up to isomorphism) when: (a) r=s=nr=s=n, i.e., partial Latin squares, (b) r=2r=2 and s=ns=n, and (c) r=2r=2 and sns \neq n

    Santilli autotopisms of partial groups

    Get PDF
    This paper deals with those partial groups that contain a given Santilli isotopism in their autotopism group. A classification of these autotopisms is explicitly determined for partial groups of order n ≤ 4

    Eigenvalue fluctuations for random regular graphs

    Full text link
    One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random regular graphs. Specifically, we prove limit theorems for the fluctuations of linear spectral statistics of random regular graphs. We find both universal and non-universal behavior. Our most important tool is Stein's method for Poisson approximation, which we develop for use on random regular graphs. This is my Ph.D. thesis, based on joint work with Ioana Dumitriu, Elliot Paquette, and Soumik Pal. For the most part, it's a mashed up version of arXiv:1109.4094, arXiv:1112.0704, and arXiv:1203.1113, but some things in here are improved or new. In particular, Chapter 4 goes into more detail on some of the proofs than arXiv:1203.1113 and includes a new section. See Section 1.3 for more discussion on what's new and who contributed to what.Comment: 103 pages; Ph.D. thesis at the University of Washington, 201

    Distribución de álgebras de lie, MALCEV y evolución en clases de isotopismos

    Get PDF
    El presente manuscrito trata distintos aspectos de la teoría de isotopismos de álgebras, centrándose en particular en los isotopismos de álgebras de Lie, de Malcev y de evolución, los cuáles no han sido suficientemente estudiados en la literatura. La distribución que sigue el manuscrito se detalla a continuación. En el Capítulo 1 se expone un breve estudio acerca del origen y desarrollo de la teoría de isotopismos, constituyendo en este sentido la primera introducción en la literatura existente en introducir la mencionada teoría desde un punto de vista general. El Capítulo 2 trata de aquellos resultados en Geometría Algebraica Computacional y en Teoría de Grafos que usamos a lo largo del manuscrito con vistas a determinar computacionalmente las clases de isotopismos de cada tipo de álgebra bajo consideración en los siguientes capítulos. Se describen en particular un par de grafos que permiten definir funtores inyectivos entre álgebras de dimensión finita sobre cuerpos finitos y los citados grafos. El cálculo computacional de invariantes por isomorfismos de estos grafos juega un papel destacable en la distribución de las distintas familias de álgebras en clases de isotopismos y de isomorfismos. Algunos resultados preliminares son expuestos en este sentido, particularmente acerca de la distribución de anillos de cuasigrupos parciales sobre cuerpos finitos. El Capítulo 3 se centra en la distribución de clases de isomorfismos y de isotopismos de dos familias de álgebras de Lie: el conjunto Pn;q de álgebras de Lie prefiliformes n-dimensionales sobre el cuerpo finito Fq y el conjunto Fn(K) de álgebras de Lie filiformes n-dimensionales sobre un cuerpo K. Se prueba concretamente la existencia de n clases de isotopismos en Pn;q. También se introducen dos nuevas series de invariantes por isotopismos que son usados para determinar las clases de isotopismos del conjunto Fn(K) para n≤7 sobre cuerpos algebraicamente cerrados y sobre cuerpos finitos. El Capítulo 4 trata con distintos ideales radicales cero-dimensionales cuyos conjuntos algebraicos asociados pueden indentificarse de forma única con el conjunto Mn(K) de álgebras de Malcev n-dimensionales sobre un cuerpo finito K. El cálculo computacional de sus bases reducidas de Gröbner, junto a la clasificación de álgebras de Lie sobre cuerpos finitos dada por De Graaf y Strade, permiten determinar la distribución de M3(K) y M4(K) no sólo en clases de isomorfismos, que es el criterio usual, sino también en clases de isotopismos. En concreto, probamos la existencia de cuatro clases de isotopismos en M3(K) y ocho clases de isotopismos en M4(K). Además, se prueba que todo álgebra de Malcev 3-dimensional sobre cualquier cuerpo finito y todo álgebra de Malcev 4-dimensional sobre un cuerpo finito de característica distinta de dos es isotópica a un magma-álgebra de Lie. Finalmente, el Capítulo 5 trata con el conjunto En(K) de álgebras de evolución n-dimensionales sobre un cuerpo K, cuya distribución en clases de isotopismos está relacionada de forma única con mutaciones en Genética no Mendeliana. Se centra en concreto en el caso bi-dimensional, el cuál está relacionado con los procesos de reproducción asexual de organismos diploides. Se prueba en particular que el conjunto E2(K) se distribuye en cuatro clases de isotopismos, independientemente de cuál sea el cuerpo base y se caracteriza sus clases de isomorfismos.This manuscript deals with distinct aspects of the theory of isotopisms of algebras. Particularly, we focus on isotopisms of Lie, Malcev and evolution algebras, for which this theory has not been enough studied in the literature. The manuscript is organized as follows. In Chapter 1 we expose a brief survey about the origin and development of the theory of isotopisms. This constitutes a first attempt in the literature to introduce this theory from a general point of view. Chapter 2 deals with those results in Computational Algebraic Geometry and Graph Theory that we use throughout the manuscript in order to compute the isotopism classes of each type of algebra under consideration in the subsequent chapters. We describe in particular a pair of graphs that enable us to define faithful functors between finite-dimensional algebras over finite fields and these graphs. The computation of isomorphism invariants of these graphs plays a remarkable role in the distribution of distinct families of algebras into isotopism and isomorphism classes. Some preliminary results are exposed in this regard, particularly on the distribution of partial-quasigroup rings over finite fields. Chapter 3 focuses on the distribution into isomorphism and isotopism classes of two families of Lie algebras: the set Pn;q of n-dimensional pre- filiform Lie algebras over the finite field Fq and the set Fn(K) of n-dimensional filiform Lie algebras over a base field K. Particularly, we prove the existence of n isotopism classes in Pn;q. We also introduce two new series of isotopism invariants that are used to determine the isotopism classes of the set Fn(K) for n ≤ 7 over algebraically closed fields and finite fields. Chapter 4 deals with distinct zero-dimensional radical ideals whose related algebraic sets are uniquely identified with the set Mn(K) of n-dimensional Malcev magma algebras over a finite field K. The computation of their reduced Gröbner bases, together with the classification of Lie algebras over finite fields given by De Graaf and Strade, enable us to determine the distribution of M3(K) and M4(K) not only into isomorphism classes, which is the usual criterion, but also into isotopism classes. Particularly, we prove the existence of four isotopism classes in M3(K) and eight isotopism classes in M4(K). Besides, we prove that every 3-dimensional Malcev algebra over any finite field and every 4-dimensional Malcev algebra over a finite field of characteristic distinct from two is isotopic to a Lie magma algebra. Finally, Chapter 5 deals with the set En(K) of n-dimensional evolution algebras over a field K, whose distribution into isotopism classes is uniquely related with mutations in non-Mendelian genetics. Particularly, we focus on the two-dimensional case, which is related to the asexual reproduction processes of diploid organisms. We prove that the set E2(K) is distributed into four isotopism classes, whatever the base field is, and we characterize its isomorphism classes
    corecore