Canadian Mathematical Society
Canadian Mathematical Society
  location:  Publicationsjournals
Search results

Search: MSC category 68 ( Computer science )

  Expand all        Collapse all Results 1 - 6 of 6

1. CJM 2017 (vol 69 pp. 992)

Bremner, Murray; Dotsenko, Vladimir
Classification of Regular Parametrized One-relation Operads
Jean-Louis Loday introduced a class of symmetric operads generated by one bilinear operation subject to one relation making each left-normed product of three elements equal to a linear combination of right-normed products: \[ (a_1a_2)a_3=\sum_{\sigma\in S_3}x_\sigma\, a_{\sigma(1)}(a_{\sigma(2)}a_{\sigma(3)})\ ; \] such an operad is called a parametrized one-relation operad. For a particular choice of parameters $\{x_\sigma\}$, this operad is said to be regular if each of its components is the regular representation of the symmetric group; equivalently, the corresponding free algebra on a vector space $V$ is, as a graded vector space, isomorphic to the tensor algebra of $V$. We classify, over an algebraically closed field of characteristic zero, all regular parametrized one-relation operads. In fact, we prove that each such operad is isomorphic to one of the following five operads: the left-nilpotent operad defined by the relation $((a_1a_2)a_3)=0$, the associative operad, the Leibniz operad, the dual Leibniz (Zinbiel) operad, and the Poisson operad. Our computational methods combine linear algebra over polynomial rings, representation theory of the symmetric group, and Gröbner bases for determinantal ideals and their radicals.

Keywords:parametrized one-relation algebra, algebraic operad, Koszul duality, representation theory of the symmetric group, determinantal ideal, Gröbner basis
Categories:18D50, 13B25, 13P10, 13P15, 15A54, 17-04, , , , , 17A30, 17A50, 20C30, 68W30

2. CJM 2012 (vol 65 pp. 961)

Aholt, Chris; Sturmfels, Bernd; Thomas, Rekha
A Hilbert Scheme in Computer Vision
Multiview geometry is the study of two-dimensional images of three-dimensional scenes, a foundational subject in computer vision. We determine a universal Gröbner basis for the multiview ideal of $n$ generic cameras. As the cameras move, the multiview varieties vary in a family of dimension $11n-15$. This family is the distinguished component of a multigraded Hilbert scheme with a unique Borel-fixed point. We present a combinatorial study of ideals lying on that Hilbert scheme.

Keywords:multigraded Hilbert Scheme, computer vision, monomial ideal, Groebner basis, generic initial ideal
Categories:14N, 14Q, 68

3. CJM 2009 (vol 61 pp. 451)

Valeriote, Matthew A.
A Subalgebra Intersection Property for Congruence Distributive Varieties
We prove that if a finite algebra $\m a$ generates a congruence distributive variety, then the subalgebras of the powers of $\m a$ satisfy a certain kind of intersection property that fails for finite idempotent algebras that locally exhibit affine or unary behaviour. We demonstrate a connection between this property and the constraint satisfaction problem.

Keywords:congruence distributive, constraint satisfaction problem, tame congruence theory, \jon terms, Mal'cev condition
Categories:08B10, 68Q25, 08B05

4. CJM 2007 (vol 59 pp. 1008)

Kaczynski, Tomasz; Mrozek, Marian; Trahan, Anik
Ideas from Zariski Topology in the Study of Cubical Homology
Cubical sets and their homology have been used in dynamical systems as well as in digital imaging. We take a fresh look at this topic, following Zariski ideas from algebraic geometry. The cubical topology is defined to be a topology in $\R^d$ in which a set is closed if and only if it is cubical. This concept is a convenient frame for describing a variety of important features of cubical sets. Separation axioms which, in general, are not satisfied here, characterize exactly those pairs of points which we want to distinguish. The noetherian property guarantees the correctness of the algorithms. Moreover, maps between cubical sets which are continuous and closed with respect to the cubical topology are precisely those for whom the homology map can be defined and computed without grid subdivisions. A combinatorial version of the Vietoris-Begle theorem is derived. This theorem plays the central role in an algorithm computing homology of maps which are continuous with respect to the Euclidean topology.

Categories:55-04, 52B05, 54C60, 68W05, 68W30, 68U10

5. CJM 2003 (vol 55 pp. 266)

Kogan, Irina A.
Two Algorithms for a Moving Frame Construction
The method of moving frames, introduced by Elie Cartan, is a powerful tool for the solution of various equivalence problems. The practical implementation of Cartan's method, however, remains challenging, despite its later significant development and generalization. This paper presents two new variations on the Fels and Olver algorithm, which under some conditions on the group action, simplify a moving frame construction. In addition, the first algorithm leads to a better understanding of invariant differential forms on the jet bundles, while the second expresses the differential invariants for the entire group in terms of the differential invariants of its subgroup.

Categories:53A55, 58D19, 68U10

6. CJM 2001 (vol 53 pp. 696)

Currie, J.; Linek, V.
Avoiding Patterns in the Abelian Sense
We classify all 3 letter patterns that are avoidable in the abelian sense. A short list of four letter patterns for which abelian avoidance is undecided is given. Using a generalization of Zimin words we deduce some properties of $\o$-words avoiding these patterns.

Categories:05, 68

© Canadian Mathematical Society, 2017 :