相关论文: Betti numbers of inductively pierced codes

Implicit Neural Representations (INRs) have emerged as a powerful tool for geometric representation, yet their suitability for physics-based simulation remains underexplored. While metrics like Hausdorff distance quantify surface…

The ideals generated by fold products of linear forms are generalizations of powers of defining ideals of star configurations, or of Veronese type ideals, and in this paper we study their Betti numbers. In earlier work, the authors together…

The total Betti numbers of the toric ideal of a simple graph are, in general, highly sensitive to any small change of the graph. In this paper we look at some combinatorial operations that cause total Betti numbers to change in predictable…

Selfridge, along with Sutherland and Marr provided some of the earliest proposals for how to program computers to recognize shapes. Their emphasis on filtering for contour features, especially the orientation of boundary segments, was…

Let $K$ be a field and let $S=K[x_1,\dots,x_n]$ be a standard polynomial ring over a field $K$. We characterize the extremal Betti numbers, values as well positions, of a $t$-spread strongly stable ideal of $S$. Our approach is…

We explore neural painters, a generative model for brushstrokes learned from a real non-differentiable and non-deterministic painting program. We show that when training an agent to "paint" images using brushstrokes, using a differentiable…

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

Given finite simple graph one can associate the edge ideal. In this paper we discuss the non-vanishingness of the graded Betti numbers of edge ideals in terms of the original graph. In particular, we give a necessary and sufficient…

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

Let $G$ be a finitely generated abelian group, and let $S = A[x_1, ..., x_n]$ be a $G$-graded polynomial ring over a commutative ring $A$. Let $I_1, ..., I_s$ be $G$-homogeneous ideals in $S$, and let $M$ be a finitely generated $G$-graded…

We introduce an algorithm where the individual bits representing the weights of a neural network are learned. This method allows training weights with integer values on arbitrary bit-depths and naturally uncovers sparse networks, without…

Gross and Popescu conjectured that the homogeneous ideal of an embedded $(1,d)$-polarized abelian surface is generated by quadrics and cubics for $d\geq 9$. We prove this using the projective normality of the embedding. It follows that the…

We study how Betti numbers of ideals in a local ring change under small perturbations. Given $p\in\mathbb N$ and given an ideal $I$ of a Noetherian local ring $(R,\mathfrak m)$, our main result states that there exists $N>0$ such that if…

Our formal understanding of the inductive bias that drives the success of convolutional networks on computer vision tasks is limited. In particular, it is unclear what makes hypotheses spaces born from convolution and pooling operations so…

In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…

We study abelian varieties $A$ with multiplication by a totally indefinite quaternion algebra over a totally real number field and give a criterion for the existence of principal polarizations on them in pure arithmetic terms. Moreover, we…

Grammatical inference is a classical problem in computational learning theory and a topic of wider influence in natural language processing. We treat grammars as a model of computation and propose a novel neural approach to induction of…

Artificial and biological neural networks (ANNs and BNNs) can encode inputs in the form of combinations of individual neurons' activities. These combinatorial neural codes present a computational challenge for direct and efficient analysis…

In this paper we describe three different variations of prime ideals: strongly irreducible ideals, strongly prime ideals and insulated prime ideals in the context of Leavitt path algebras. We give necessary and sufficient conditions under…

Implicit neural representations (INRs) have achieved remarkable successes in learning expressive yet compact signal representations. However, they are not naturally amenable to predictive tasks such as segmentation, where they must learn…