Logo del repository
  1. Home
 
Opzioni

CW-complex Nagata idealizations

Armando Capasso
•
Pietro De Poi
•
Giovanna Ilardi
2020
  • journal article

Periodico
ADVANCES IN APPLIED MATHEMATICS
Abstract
We introduce a construction which allows us to identify the elements of the skeletons of a CW-complex P(m) and the monomials in m variables. From this, we infer that there is a bijection between finite CW-subcomplexes of P(m), which are quotients of finite simplicial complexes, and certain bigraded standard Artinian Gorenstein algebras, generalizing previous constructions of Faridi and ourselves. We apply this to a generalization of Nagata idealization for level algebras. These algebras are standard graded Artinian algebras whose Macaulay dual generator is given explicitly as a bigraded polynomial of bidegree (1, d). We consider the algebra associated to polynomials of the same bidegree (d1, d2).
DOI
10.1016/j.aam.2020.102079
WOS
WOS:000556210300013
Archivio
http://hdl.handle.net/11390/1187437
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85087199764
https://reader.elsevier.com/reader/sd/pii/S0196885820300828?token=C19EA5575A4DA79F01CD6C1D773166F51F321ADE37994DDB8C27DBD54A6B61A07153F305B656CDEBFABBA4DB0B2EA79C
Diritti
open access
Soggetti
  • Lefschetz propertie

  • Artinian Gorenstein a...

  • Nagata idealization

  • CW-complex

Scopus© citazioni
0
Data di acquisizione
Jun 14, 2022
Vedi dettagli
Web of Science© citazioni
1
Data di acquisizione
Mar 27, 2024
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback