Results 61 to 70 of about 1,404 (215)
Integer sequences and monomial ideals
Let $\mathfrak{S}_n$ be the set of all permutations of $[n]=\{1,\ldots,n\}$ and let $W$ be the subset consisting of permutations $σ\in \mathfrak{S}_n$ avoiding 132 and 312-patterns. The monomial ideal $I_W = \left\langle \mathbf{x}^σ = \prod_{i=1}^n x_i^{σ(i)} : σ\in W \right\rangle $ in the polynomial ring $R = k[x_1,\ldots,x_n]$ over a field $k$ is ...
Kumar, Chanchal, Roy, Amit
openaire +2 more sources
Some remarks on the Stanley depth for multigraded modules
We show that Stanley’s conjecture holds for any multigraded module M over S, with sdepth(M) = 0, where S = K[x_1; ... ; x_n]. Also, we give some bounds for the Stanley depth of the powers of the maximal irrelevant ideal in S.
Mircea Cimpoeas
doaj
Sensitivity and Hamming Graphs
ABSTRACT For any m ≥ 3 we show that the Hamming graph H ( n , m ) admits an imbalanced partition into m sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source
Monomial Ideals of Graphs with Loops [PDF]
Abstract We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the polynomial ring related to these graphs modulo such ideals.
IMBESI, Maurizio, LA BARBIERA, MONICA
openaire +4 more sources
Nonlinear Model Order Reduction on Polynomial Manifolds for Computational Homogenisation Problems
ABSTRACT Model order reduction (MOR) techniques utilising nonlinear approximation spaces can search for solutions to computational homogenisation problems on low‐dimensional approximation spaces. In combination with hyperreduction techniques, this allows for computations on representative volume elements (RVEs) to be accelerated by multiple orders of ...
Erik Faust, Lisa Scheunemann
wiley +1 more source
Bar code for monomial ideals [PDF]
58 ...
openaire +7 more sources
Abstract Let F$F$ be a non‐Archimedean local field with odd characteristic p$p$. Let N$N$ be a positive integer and G=Sp2N(F)$G=\operatorname{Sp}_{2N}(F)$. By work of Lomelí on γ$\gamma$‐factors of pairs and converse theorems, a generic supercuspidal representation π$\pi$ of G$G$ has a transfer to a smooth irreducible representation Ππ$\Pi _\pi$ of ...
Corinne Blondel +2 more
wiley +1 more source
ON THE STANLEY DEPTH OF EDGE IDEALS OF LINE AND CYCLIC GRAPHS
We prove that the edge ideals of line and cyclic graphs and their quotient rings satisfy the Stanley conjecture. We compute the Stanley depth for the quotient ring of the edge ideal associated to a cycle graph of length n, given a precise formula for n ≡
MIRCEA CIMPOEAS
doaj
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
wiley +1 more source
The paper deals with the problem of the expression of associated prime ideals of monomial curves in the affine space A4 as set-theoretic complete intersections.
Michaela Holesova
doaj +1 more source

