Related papers: Generating sequences of rank 1 valuations

When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…

Gr\"obner bases have been generalized by replacing monomial orders with constructions such as valuations and filtrations. We consider suitable valuations on a rational valuation field $K(x,y)$ and analyze their behavior when restricting to…

We give a complete classification of globally generated vector bundles of rank 3 on a smooth quadric threefold with $c_1\leq 2$ and extend the result to arbitrary higher rank case. We also investigate the existence of globally generated…

We describe the K-ring of the classifying space of the generalized quaternion group in terms of generators and the minimal set of relations. We also compute the order of the main generator in the truncated rings.

Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…

Many kinds of data are naturally amenable to being treated as sequences. An example is text data, where a text may be seen as a sequence of words. Another example is clickstream data, where a data instance is a sequence of clicks made by a…

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.

Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…

The rank of a ring $R$ is the supremum of minimal cardinalities of generating sets of $I$ as $I$ ranges over ideals of $R$. Matson showed that every positive integer occurs as the rank of some ring $R$. Motivated by the result of Cohen and…

For a fixed dimension $N$ we compute the generating function of the numbers $t_N(n)$ (respectively $\bar{t}_N(n)$) of $PGL_{N+1}(k)$-orbits of rational $n$-sets (respectively rational $n$-multisets) of the projective space $\mathb{P}^N$…

We give a characteristic free proof of the main result of our previous paper (math.AC/0509697) concerning toroidalization of generating sequences of valuations in dimension two function fields. We show that when an extension of two…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

We consider a rank-one symmetric matrix corrupted by additive noise. The rank-one matrix is formed by an $n$-component unknown vector on the sphere of radius $\sqrt{n}$, and we consider the problem of estimating this vector from the…

In this paper we show if R is a filtered ring and M a filtered R module then we can define a valuation on a module for M. Then we show that we can find an skeleton of valuation on M, and we prove some properties such that derived form it…

The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more than two indices. The generic rank may be seen as an upper…

We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a…

Let R be a discrete valuation ring (DVR) and K be its fraction field. If M is a matrix over R admitting a LU decomposition, it could happen that the entries of the factors L and U do not lie in R, but just in K. Having a good control on the…

This paper concerns a deep learning approach to relevance ranking in information retrieval (IR). Existing deep IR models such as DSSM and CDSSM directly apply neural networks to generate ranking scores, without explicit understandings of…