Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Palezzato, Elisa"'
A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them comprehensive Gr
Externí odkaz:
http://arxiv.org/abs/2404.13514
In this article, we study the weak and strong Lefschetz of higher dimensional quotients and dimension 1 almost complete intersections. We then apply the obtained results to the study of the Jacobian algebra of hyperplane arrangements.
Comment: a
Comment: a
Externí odkaz:
http://arxiv.org/abs/2310.17794
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the middle graph. We also compute the total outer-connected domination numbe
Externí odkaz:
http://arxiv.org/abs/2308.02127
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G). We also compute the outer-connected
Externí odkaz:
http://arxiv.org/abs/2206.15439
A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. In thi
Externí odkaz:
http://arxiv.org/abs/2204.07040
Publikováno v:
Innov. Incidence Geom. 21 (2024) 117-130
In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced by Crapo
Externí odkaz:
http://arxiv.org/abs/2201.03007
A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a total dom
Externí odkaz:
http://arxiv.org/abs/2104.12305
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph. We also compute the domination number of some families of graphs such as star graphs, double start grap
Externí odkaz:
http://arxiv.org/abs/2008.02975
Autor:
Palezzato, Elisa, Torielli, Michele
In this article, we study the $k$-Lefschetz properties for non-Artinian algebras, proving that several known results in the Artinian case can be generalized in this setting. Moreover, we describe how to characterize the graded algebras having the $k$
Externí odkaz:
http://arxiv.org/abs/2003.06294
In combinatorics, a latin square is a $n\times n$ matrix filled with n different symbols, each occurring exactly once in each row and exactly once in each column. Associated to each latin square, we can define a simple graph called a latin square gra
Externí odkaz:
http://arxiv.org/abs/1911.10673