Related papers: On multi-index filtrations associated to Weierstra…

For G a semisimple algebraic group, we revisit the description of the components of the affne Springer fiber given by ts, with s a regular semisimple element. We then compute the fixed points of each component of a particular affne Springer…

The study of the relation between the Weierstrass inducing formulae for constant mean curvature surfaces and the completely integrable euclidean nonlinear sigma-model suggests a connection among integrable sigma -models in a background and…

In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

This paper is the second part of a two part paper which introduces the study of the Whitney Equisingularity of families of Symmetric determinantal singularities. This study reveals how to use the multiplicity of polar curves associated to a…

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

This is a survey of using Minsky machines to study algorithmic problems in semigroups, groups and other algebraic systems.

Let $(S,H)$ be a generalized Fermat pair of the type $(k,n)$. If $F\subset S$ is the set of fixed points of the non-trivial elements of the group $H$, then $F$ is exactly the set of hyperosculating points of the standard embedding…

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…

Symmetries play an critical role in finding analytic solutions to nonlinear differential equations. A symmetry is a mapping of the solutions of the differential equation into the solutions and have been studied extensively for over a…

Let $P$ be a set of $m$ points in ${\mathbb R}^2$, let $\Sigma$ be a set of $n$ semi-algebraic sets of constant complexity in ${\mathbb R}^2$, let $(S,+)$ be a semigroup, and let $w: P \rightarrow S$ be a weight function on the points of…

We present a new method to explicitly define Abelian functions associated with algebraic curves, for the purpose of finding bases for the relevant vector spaces of such functions. We demonstrate the procedure with the functions associated…

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

We describe in simple geometric terms the Hodge filtration on the cohomology groups of the complement U in the projective plane of a curve C with ordinary double and triple points. Relations to Milnor algebra, syzygies of the Jacobian ideal…

The Weierstrass curve is a pointed curve $(X,\infty)$ with a numerical semigroup $H_X$, which is a normalization of the curve given by the Weierstrass canonical form, $y^r + A_{1}(x) y^{r-1} + A_{2}(x) y^{r-2} +\dots + A_{r-1}(x) y +…

In this paper, we compute the 1-gap sequences of 1-Weierstrass points on non-hyperelliptic smooth projective curves of genus 10. Furthermore, the geometry of such points is classified as flexes, sextactic and tentactic points. Also, an…

Biclustering is an unsupervised machine learning technique that simultaneously clusters rows and columns in a data matrix. Biclustering has emerged as an important approach and plays an essential role in various applications such as…

We present the operator semigroups approach to first- and second-order dynamical systems taking place on metric graphs. We briefly survey the existing results and focus on the well-posedness of the problems with standard vertex conditions.…

We suggest a few projects for studying vertex algebras with emphasis on finite group viewpoints.

Cluster analysis methods seek to partition a data set into homogeneous subgroups. It is useful in a wide variety of applications, including document processing and modern genetics. Conventional clustering methods are unsupervised, meaning…