On some computational algorithms forn-fold ideals in BCK-algebras

This paper is devoted to thefoldness theory of implicative ideals in BCK-algebras. We use the fuzzy point concept to give some characterizations of fuzzyn-fold implicative ideals and establish some relationships with variousn-fold ideals. We also construct some algorithms for studying the foldness of implicative ideals in BCK-algebras.     

Stanley Depth of Quotient of Monomial Complete Intersection Ideals

We compute the Stanley depth for a particular but important case of the quotient of complete intersection monomial ideals. Also, in the general case, we give sharp bounds for the Stanley depth of a quotient of complete intersection monomial ideals. In particular, we prove the Stanley conjecture for quotients of complete intersection monomial ideals.     

∗-Finite ideals contained in infinitely many maximal ∗ s -ideals

We give a new characterization of ?-finite ideals that are contained in infinity many ? _s -maximal ideals.     

A comparison of error bounds for linear complementarity problems of H-matrices

We give new error bounds for the linear complementarity problem when the involved matrix is an H-matrix with positive diagonals. We find classes of H-matrices for which the new bounds improve considerably other previous bounds. We also show advantages of these new bounds with respect the computational cost. A new perturbation bound of H-matrices linear complementarity problems is also presented.     

Matchings in simplicial complexes, circuits and toric varieties

Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties.     

Castelnuovo-Mumford regularity by approximation

The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and the module of derivations of a hyperplane arrangement as well as to give degree bounds for invariants of finite groups.     

Weighted and roughly weighted simple games

In this paper we give necessary and sufficient conditions for a simple game to have rough weights. We define two functions f(n) and g(n) that measure the deviation of a simple game from a weighted majority game and roughly weighted majority game, respectively. We formulate known results in terms of lower and upper bounds for these functions and improve those bounds. We also investigate rough weightedness of simple games with a small number of players.     

Resolutions of letterplace ideals of posets

We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than c chains, we show that the Betti numbers may be computed from simplicial complexes of no more than c vertices. We also give a recursive procedure to compute the Betti diagrams when the Hasse diagram of P has tree structure.     

Codimension and projective dimension up to symmetry

Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is known that the codimensions grow eventually linearly. Here this result is extended to chains of arbitrary symmetric ideals. Moreover, the slope of the linear function is explicitly determined. We conjecture that the projective dimensions also grow eventually linearly. As part of the evidence we establish two non-trivial lower linear bounds of the projective dimensions for chains of monomial ideals. As an application, this yields Cohen–Macaulayness obstructions.     

Subsemigroup,ideal and congruence growth of free semigroups

The growth of cofinite subsemigroups of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type nⁿ for finite free rank greater than 1. Ideal growth is shown to be exponential with strict type 2ⁿ and congruence growth is shown to be at least exponential. In addition we consider the case when the index is fixed and rank increasing, proving that for subsemigroups and ideals this sequence fits a polynomial of degree the index, whereas for congruences this fits an exponential equation of base the index. We use these results to describe an algorithm for computing values of these sequences and give a table of results for low rank and index.     

Exponential sums over lifts of points

We give bounds for exponential sums associated to functions on curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and give bounds for the degrees of their coordinate functions. Then we get bounds for exponential sums, extending results of Kumar et al., Winnie Li over the projective line, and Voloch-Walker over elliptic curves and C_ab curves.     

Regularity 3 in edge ideals associated to bipartite graphs

We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step i in the minimal graded free resolution where there exists a minimal generator of degree >i+3, show that at this step the highest degree of a minimal generator is i+4, and determine the corresponding graded Betti number β _i,i+4 in terms of the combinatorics of the graph. The results are then extended to the non-square-free case through polarization. We also study a family of ideals of regularity 4 that play an important role in our main result and whose graded Betti numbers can be completely described through closed combinatorial formulas.     

Hypergraphical t-designs

We introduce a theory of hypergraphical t-designs. We show the existence of these designs and prove a finiteness theorem on these designs for infinitely many parameter sets. We also give effective bounds on the number of points in these cases. These results generalize some results on graphical t-designs of Alltop, Chee and Betten-Klin-Laue-Wassermann.     

FINITENESS OF HILBERT FUNCTIONS FOR GENERALIZED COHEN–MACAULAY MODULES

We give effective bounds on the higher Hilbert coefficients of finitely generated modules over Noetherian local rings (A, m) with respect to m-primary ideals, in terms of the multiplicity, dimension and the lengths of local cohomology modules. We similarly bound the Castelnuovo–Mumford regularity of the associated Rees modules.     

Hereditary Endomorphism Rings of Mixed Abelian Groups

Let A be a finite-rank, torsion-free, self-small mixed abelian sp-group and let E(A) be the endomorphism ring of A. We give conditions for right and left heredity of E(A). A ring is right hereditary if each of its right ideals is projective. We also find the structure of one-sided ideals of E(A).     

Explicit determination of certain minimal constabelian codes

Constabelian codes can be viewed as ideals in twisted group algebras over finite fields. In this paper we study decomposition of semisimple twisted group algebras of finite abelian groups and prove results regarding complete determination of a full set of primitive orthogonal idempotents in such algebras. We also explicitly determine complete sets of primitive orthogonal idempotents of twisted group algebras of finite cyclic and abelian p-groups. We also describe methods of determining complete set of primitive idempotents of abelian groups whose orders are divisible by more than one prime and give concrete (numerical) examples of minimal constabelian codes, illustrating the above mentioned results.     

Decompositions,Partitions, and Coverings with Convex Polygons and Pseudo-Triangles

We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex k-gons in point sets.