相关论文: Theory and applications of lattice point methods f…

The main goal of this article is to introduce BL-rings, i.e., commutative rings whose lattices of ideals can be equipped with a structure of BL-algebra. We obtain a description of such rings, and study the connections between the new class…

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…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.

The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of…

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…

Let $G$ be a graph on the vertex set $[n]$ and $J_G$ the associated binomial edge ideal in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate the depth of binomial edge ideals. More precisely, we…

We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…

We introduce and study the concept of positive polynomial ideals between Banach lattices. The paper develops the basic principles of these classes and presents methods for constructing positive polynomial ideals from given positive operator…

From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…

Gr\"obner bases of binomial ideals arising from finite lattices will be studied. In terms of Gr\"obner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.

This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…

We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…

Models for what may lie behind the Standard Model often require non-perturbative calculations in strongly coupled field theory. This creates opportunities for lattice methods, to obtain quantities of phenomenological interest as well as to…

In this article, we study the primary decomposition of some binomial ideals. In particular, we introduce the concept of polyocollection, a combinatorial object that generalizes the definitions of collection of cells and polyomino, that can…

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems,…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…