English
Related papers

Related papers: The seed order

200 papers

We introduce and study in detail the notion of compatibility between valuations and orderings in real hyperfields. We investigate their relation with valuations and orderings induced on factor and residue hyperfields. Much of the theory…

Commutative Algebra · Mathematics 2021-06-10 Katarzyna Kuhlmann , Alessandro Linzi , Hanna Stojałowska

In this paper, we study an unconventional but practically meaningful reversibility problem of commonly used image filters. We broadly define filters as operations to smooth images or to produce layers via global or local algorithms. And we…

Computer Vision and Pattern Recognition · Computer Science 2017-04-14 Xin Tao , Chao Zhou , Xiaoyong Shen , Jue Wang , Jiaya Jia

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…

Combinatorics · Mathematics 2022-02-10 Shashwat Agrawal , Amit Kuber , Esha Gupta

Many tasks in natural language processing involve predicting structured outputs, e.g., sequence labeling, semantic role labeling, parsing, and machine translation. Researchers are increasingly applying deep representation learning to these…

Computation and Language · Computer Science 2020-10-07 Lifu Tu , Tianyu Liu , Kevin Gimpel

The sequential structure of language, and the order of words in a sentence specifically, plays a central role in human language processing. Consequently, in designing computational models of language, the de facto approach is to present…

Computation and Language · Computer Science 2021-08-25 Rishi Bommasani

A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…

Commutative Algebra · Mathematics 2022-06-22 H. Behzadipour , P. Nasehpour

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

Logic · Mathematics 2015-08-03 Lawrence Valby

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

Logic · Mathematics 2025-10-15 Aaron Anderson , Diego Bejarano

We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…

Logic · Mathematics 2017-12-19 Andreas Blass , Mauro Di Nasso , Marco Forti

Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…

Logic · Mathematics 2009-06-23 Henry Towsner

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…

Logic · Mathematics 2021-03-17 Boris Šobot

We investigate lifted inference on ordered domains with predecessor relations, where the elements of the domain respect a total (cyclic) order, and every element has a distinct (clockwise) predecessor. Previous work has explored this…

Artificial Intelligence · Computer Science 2025-07-28 Kuncheng Zou , Jiahao Mai , Yonggang Zhang , Yuyi Wang , Ondřej Kuželka , Yuanhong Wang , Yi Chang

Let $n$ be any positive integer and $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ be the semigroup of all order isomorphisms between principal filters of the $n$-th power of the set of positive integers $\mathbb{N}$ with the product order. We study…

Group Theory · Mathematics 2019-02-28 Oleg Gutik , Taras Mokrytskyi

In this paper we introduce a very general setting dealing with the superposition of operators of any positive order and provide a systematic study of them. We also provide examples and counterexamples, as well as characterizing properties…

Analysis of PDEs · Mathematics 2025-10-10 Serena Dipierro , Sven Jarohs , Enrico Valdinoci

We study the well-posedness of a linear control system $\Sigma(A,B,C,D)$ with unbounded control and observation operators. To this end we associate to our system an operator matrix $\mathcal{A}$ on a product space $\mathcal{X}^p$ and call…

Functional Analysis · Mathematics 2013-10-23 Miriam Bombieri , Klaus-Jochen Engel

A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…

Data Structures and Algorithms · Computer Science 2022-03-02 Jon Kleinberg , Emily Ryu , Éva Tardos

Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel

Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or…

Logic in Computer Science · Computer Science 2019-04-25 Jean Goubault-Larrecq , Simon Halfon , Prateek Karandikar , K. Narayan Kumar , Philippe Schnoebelen
‹ Prev 1 8 9 10 Next ›