English
Related papers

Related papers: The MacaulayPosets package for Macaulay2

200 papers

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

Combinatorics · Mathematics 2024-05-30 Ulysses Alvarez , Ross Geoghegan

This is the Hadamard package for Macaulay2 which computes the Hadamard product of projective subvarieties.

Algebraic Geometry · Mathematics 2020-12-21 Iman Bahmani Jafarloo

In this paper we study the complex simultaneous Waring rank for collections of monomials. For general collections we provide a lower bound, whereas for special collections we provide a formula for the simultaneous Waring rank. Our approach…

Algebraic Geometry · Mathematics 2018-05-08 Enrico Carlini , Emanuele Ventura

The `Weyl symmetric functions' studied here naturally generalize classical symmetric (polynomial) functions, and `Weyl bialternants,' sometimes also called Weyl characters, analogize the Schur functions. For this generalization, the…

Combinatorics · Mathematics 2021-09-08 Robert G. Donnelly

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.

A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…

Algebraic Topology · Mathematics 2020-08-12 Ezra Miller

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.

Combinatorics · Mathematics 2011-10-18 Christian Joseph Altomare

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

Combinatorics · Mathematics 2014-06-10 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…

Formal Languages and Automata Theory · Computer Science 2019-10-15 Uli Fahrenberg , Christian Johansen , Georg Struth , Ratan Bahadur Thapa

In this paper we find monomial bases for the integer cohomology rings of compact wonderful models of toric arrangements. In the description of the monomials various combinatorial objects come into play: building sets, nested sets, and the…

Algebraic Topology · Mathematics 2023-01-16 Giovanni Gaiffi , Oscar Papini , Viola Siconolfi

Three families of posets depending on a nonnegative integer parameter $m$ are introduced. The underlying sets of these posets are enumerated by the $m$-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and…

Combinatorics · Mathematics 2021-04-27 Camille Combe , Samuele Giraudo

In this paper we study the problem of describing the integral subschemes within a fixed even linkage class $\L$ of subschemes in $\Pn$ of codimension two. In the case that $\L$ is not the class of arithmetically Cohen-Macaulay subschemes,…

alg-geom · Mathematics 2015-06-30 Scott Nollet

We present a Macaulay2 package that produces compactifications of adjoint orbits and of the fibres of symplectic Lefschetz fibrations on them. We use Macaulay2 functions to calculate the corresponding Hodge diamonds, which then reveal…

Algebraic Geometry · Mathematics 2014-05-01 Brian Callander , Elizabeth Gasparim
‹ Prev 1 8 9 10 Next ›