相关论文: Betti numbers of inductively pierced codes

We consider the open problem of determining the graded Betti numbers for fat point subschemes supported at general points of the projective plane. We relate this problem to the open geometric problem of determining the splitting type of the…

In this paper, we use Betti splittings of binomial edge ideals to establish improved upper and lower bounds for their regularity in the case of trees. As a consequence, we determine the exact regularity for certain classes of trees.

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

We extend a result of Caviglia and Sbarra to a polynomial ring with base field of any characteristic. Given a homogeneous ideal containing both a piecewise lex ideal and an ideal generated by powers of the variables, we find a lex ideal…

Neural codes are binary codes that are used for information processing and representation in the brain. In previous work, we have shown how an algebraic structure, called the {\it neural ring}, can be used to efficiently encode geometric…

For an ideal $I$ of a Noetherian local ring $(R,\fm,k)$ we show that $\bt_1^R(I)-\bt_0^R(I)\geq -1$. It is demonstrated that some residual intersections of an ideal $I$ for which $\bt_1^R(I)-\bt_0^R(I)= -1\;\text{or}\;0$ are perfect. Some…

In the 1970s, O'Keefe and Dostrovsky discovered that certain neurons, called place cells, in an animal's brain are tied to its location within its arena. A combinatorial neural code is a collection of $0/1$-vectors which encode the patterns…

Neural codes are collections of binary vectors that represent the firing patterns of neurons. The information given by a neural code $C$ can be represented by its neural ideal $J_C$. In turn, the polynomials in $J_C$ can be used to…

It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the…

We compute the multigraded Betti numbers of edge ideals for weighted oriented crown graphs using a novel approach. This approach, which we still call the \emph{induced subgraph approach}, originates from our prior work on computing Betti…

We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

The association of algebraic objects to forms has had many important applications in number theory. Gauss, over two centuries ago, studied quadratic rings and ideals associated to binary quadratic forms, and found that ideal classes of…

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

We study the equations of abelian surfaces embedded in P^{n-1} with a line bundle of polarization of type (1,n). For n>9, we show that the ideal of a general abelian surface with this polarization is generated by quadrics, and if the…

For a neural code $\mathcal{C}\subseteq\mathbb{F}_2^n$, polarizing the canonical form generators of the neural ideal $J_{\mathcal{C}}$ yields a squarefree monomial ideal $\mathcal{P}(J_{\mathcal{C}})\subset k[x_1,\dots,x_n,y_1,\dots,y_n]$,…

Physics-informed neural networks solve partial differential equations by training neural networks. Since this method approximates infinite-dimensional PDE solutions with finite collocation points, minimizing discretization errors by…

Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

An ideal $I \subset \mathbb{k}[x_1, \ldots, x_n]$ is said to have linear powers if $I^k$ has a linear minimal free resolution, for all $k$. In this paper we study the Betti numbers of $I^k$, for ideals $I$ with linear powers. The Betti…