Related papers: Characterization of Gaps and Elements of a Numeric…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

In this paper we introduce a new and large family of configurations whose toric ideals possess quadratic Groebner bases. As an application, a generalization of algebras of Segre-Veronese type will be studied.

We review some aspects of the use of a technique known as group averaging, which provides a tool for the study of constrained systems. We focus our attention on the case where the gauge group is non-compact, and a `renormalized' group…

We present a new proof for the main claim made in the author's paper "On the identity bases of Brandt semigroups" (Ural. Gos. Univ. Mat. Zap. 14, no.1 (1985), 38--42); this claim provides an identity basis for an arbitrary Brandt semigroup…

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…

In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…

A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…

For g $\ge$ 0, let n g denote the number of numerical semi-groups of genus g. A conjecture by Maria Bras-Amor\'os in 2008 states that the inequality n g $\ge$ n g--1 + n g--2 should hold for all g $\ge$ 2. Here we show that such an…

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

There exist two different sorts of gaps in the nonsymmetric numerical additive semigroups finitely generated by a minimal set of positive integers {d_1,...,d_m}. The h-gaps are specific only for the nonsymmetric semigroups while the g-gaps…

A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be…

A numerical semigroup $M$ is a subset of the non-negative integers that is closed under addition. A factorization of $n \in M$ is an expression of $n$ as a sum of generators of $M$, and the Graver basis of $M$ is a collection $Gr(M_t)$ of…

New notions are introduced in algebra in order to better study the congruences in number theory. For example, the <special semigroups> makes an important such contribution.

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the…

This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and finite covers of those complements, focusing on homological and enumerative…

We consider a family of problems that are concerned about making predictions for the majority of unlabeled, graph-structured data samples based on a small proportion of labeled samples. Relational information among the data samples, often…

We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…