Related papers: Enumerative and planar combinatorics of trivariate…
We will describe how we can identify the structure of the Koszul algebra for trivariate monomial ideals from minimal free resolutions. We use recent work of L. Avramov, where he classifies the behavior of Bass numbers of embedding codepth 3…
In this paper we extend the well-known iterated mapping cone procedure to monomial ideals in strongly Koszul algebras. We study properties of ideals generated by monomials in commutative Koszul algebras and show that the linear strand of…
This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…
In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…
Solving difficult mixed-integer nonlinear programs via spatial branch-and-bound requires effective convex outer-approximations of nonconvex sets. In this framework, complex problem formulations are decomposed into simpler library functions,…
With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to…
The dual complex can be associated to any resolution of singularities whose exceptional set is a divisor with simple normal crossings. It generalizes to higher dimensions the notion of the dual graph of a resolution of surface singularity.…
Given a weight of sl(n), we derive a system of variable-coefficient second-order linear partial differential equations that determines the singular vectors in the corresponding Verma module. Moreover, we completely solve the system in a…
We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
We provide, in a 474 pages study, a comprehensive and self-contained treatment of Resultant Theory for a homogeneous system of polynomials with several variables (as many variables as of polynomials). In a non classical way, we use the…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…
We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join…
Consider the diagonal action of the special orthogonal group on the direct sum of a finite number of copies of the standard representation--the underlying field is assumed to be algebraically closed and of characteristic not equal to two.…
To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for the numerical solution of partial differential equations. We start with a detailed explanation of the method for the…