Related papers: On the decomposable semigroups and applications
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
The notion of automatic selfadjointness of all ideals in a multiplicative semigroup of the bounded linear operators on a separable Hilbert space B(H) arose in a 2015 discussion with Heydar Radjavi who pointed out that B(H) and the finite…
We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following…
Mixture models have found uses in many areas. To list a few: unsupervised learning, empirical Bayes, latent class and trait models. The current applications of mixture models to empirical data is limited to computing a mixture model from…
Representation learning seeks meaningful sensory representations without supervision and can model aspects of human development. Although many neural networks empirically learn useful features, a principled account of what makes a…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
This work outlines a consistent method of identifying subsystems in finite-dimensional Hilbert spaces, independent of the underlying inner-product structure. Such Hilbert spaces arise in $\mathcal{P}\mathcal{T}$-symmetric quantum mechanics,…
System performance for networks composed of interconnected subsystems can be increased if the traditionally separated subsystems are jointly optimized. Recently, parallel and distributed optimization methods have emerged as a powerful tool…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
We keep the definition of intra-regularity (left regularity) of $po$-$\Gamma$-semigroups introduced in arXiv: 1511.00679 which is absolutely necessary for the investigation. Being able to describe the form of the elements of the principal…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
We generalize the notion of semi-universality in the classical deformation problems to the context of derived deformation theories. A criterion for a formal moduli problem to be semi-prorepresentable is produced. This can be seen as an…
We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
Previous studies have used a specific success metric within an algorithmic search framework to prove machine learning impossibility results. However, this specific success metric prevents us from applying these results on other forms of…