Related papers: Combinatorial commutative algebra rules
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…
Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
We prove that the lattice of ideals of an arbitrary $L$-algebra is distributive. As a consequence, a spectral theory applies with no restriction. We also study the spectrum (i.e. the set of prime ideals) of $L$-algebras and characterize…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
An approach to the classification problem of machine learning, based on building local classification rules, is developed. The local rules are considered as projections of the global classification rules to the event we want to classify. A…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
In this paper, we introduce the concept of ideal on CL-algebra. It is proved that this concept generalizes the notion of ideal on Residuated Lattices. Prime ideal on CL-algebra are defined and few interesting properties are obtained. It has…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
For a finitely generated associative algebra $\cA$ over a commutative ring $k$ we construct the Hilbert scheme ${\bf H}^{[n]}_{\cA}$ which parametrizes left ideals in $\cA$ of codimension $n.$
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
We investigate the defining ideal of the algebra over a field generated by the join-meet binomials coming from a finite distributive lattice. In the frame of algebras with straightening laws, the problem when the defining ideal is generated…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…