Related papers: Algorithms for computing mixed multiplicities, mix…
We offer new definitions of joint reductions and mixed Buchsbaum-Rim multiplicity for certain collections of modules over a Noetherian local ring and illustrate their application to give two different proofs of a joint-reduction-number-zero…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
Using the minors in Hessian matrices, we introduce new graded algebras associated to a homogeneous polynomial. When the associated projective hypersurface has isolated singularities, these algebras are related to some new local algebras…
In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
We study the combinatorial properties of 2-dimensional tropical complexes. In particular, we prove tropical analogues of the Hodge index theorem and Noether's formula. In addition, we introduce algebraic equivalence for divisors on tropical…
The j-multiplicity is an invariant that can be defined for any ideal in a Noetherian local ring $(R, m)$. It is equal to the Hilbert-Samuel multiplicity if the ideal is $m$-primary. In this paper we explore the computability of the…
This paper is devoted to the study of multigraded algebras and multigraded linear series. For an $\mathbb{N}^s$-graded algebra $A$, we define and study its volume function $F_A:\mathbb{N}_+^s\to \mathbb{R}$, which computes the asymptotics…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.
This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…
We present the Mathematica package MultivariateResidues, which allows for the efficient evaluation of multivariate residues based on methods from computational algebraic geometry. Multivariate residues appear in several contexts of…
Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
Augmentation methods for mixed-integer (linear) programs are a class of primal solution approaches in which a current iterate is augmented to a better solution or proved optimal. It is well known that the performance of these methods, i.e.,…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…