相关论文: Complexity of Villamayor's algorithm in the non ex…

An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…

We build two embedded resolution procedures of a quasi-ordinary singularity of complex analytic hypersurface, by using toric morphisms which depend only on the characteristic monomials associated to a quasi-ordinary projection of the…

We obtain representations of $X_1$ exceptional orthogonal polynomials through determinants of matrices that have certain adjusted moments as entries. We start out directly from the Darboux transformation, allowing for a universal…

Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from mathematical models to real-world problems. Many studies…

Factoring ideals in integral domains is a central topic in multiplicative ideal theory. In the present paper we study monoids of ideals and consider factorizations of ideals into multiplicatively irreducible ideals. The focus is on the…

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

Let $G$ be a semisimple algebraic group over $\mathbb{C}$. For a reduced word $\bf i$ of the longest element in the Weyl group of $G$ and a dominant integral weight $\lambda$, one can construct the string polytope $\Delta_{\bf i}(\lambda)$,…

A classical result of Artin states that the ideal generated by symmetric polynomials in $n$ variables is of codimension $n!$. The author, F. Bergeron and N. Bergeron have recently obtained a surprising analogous in the case of…

This paper is concerned with the combinatorial description of the graded minimal free resolution of certain monomial algebras which includes toric rings. Concretely, we explicitly describe how the graded minimal free resolution of those…

We generalize an algorithm by Goward for principalization of monomial ideals in nonsingular varieties to work on any scheme of finite type over a field. The normal crossings condition considered by Goward is weakened to the condition that…

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

A Catalan word of length $n$ that avoids the pattern $(\geq, \geq)$ is a sequence $w=w_1\cdots w_n$ with $w_1=0$ and $0\leq w_i\leq w_{i-1}+1$ for all $i$, while ensuring that no subsequence satisfies $w_i \geq w_{i+1}\geq w_{i+2}$ for…

The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…

Fix nonzero ideal sheaves a_1,...,a_r on a normal Q-Gorenstein complex variety X. Fix any positive real number c, and consider the multiplier ideal J of the sum a_1+...+a_r with weighting coefficient c. We construct an exact sequence…

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

The results in this paper are of two types. On one hand, we construct sets of large Fourier dimension that avoid nontrivial solutions of certain classes of linear equations. In particular, given any finite collection of…

Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…