English
Related papers

Related papers: A half-space approach to order dimension

200 papers

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

Representation Theory · Mathematics 2019-02-27 Claudia Cavalcante Fonseca , Kostiantyn Iusenko

We initiate the study of convex geometry over ordered hyperfields. We define convex sets and halfspaces over ordered hyperfields, presenting structure theorems over hyperfields arising as quotients of fields. We prove hyperfield analogues…

Metric Geometry · Mathematics 2025-09-24 James Maxwell , Ben Smith

In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…

Functional Analysis · Mathematics 2019-12-13 Anil Kumar Karn , Amit kumar

We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…

Operator Algebras · Mathematics 2009-06-10 Vern Paulsen , Mark Tomforde

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

Algebraic Geometry · Mathematics 2022-10-25 Askold Khovanskii

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

Combinatorics · Mathematics 2012-03-28 Filippo Disanto , Luca Ferrari , Simone Rinaldi

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…

Quantum Algebra · Mathematics 2011-07-08 Tomasz Brzeziński

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

In this note we describe experiments on an implementation of two methods proposed in the literature for computing regions that correspond to a notion of order statistics for multidimensional data. Our implementation, which works for any…

Computation · Statistics 2017-04-26 David L. Woodruff , Stefan Zillmann

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…

General Topology · Mathematics 2024-01-25 Gianni Bosi , Asier Estevan , Magali Zuanon

Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-10-07 Himanshu Chauhan , Vijay K. Garg

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

Classical Analysis and ODEs · Mathematics 2026-05-28 K. Castillo

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…

Combinatorics · Mathematics 2013-02-07 Jaroslav Nesetril , Jan Hubicka

A (generalized) topological space is called an iso-dense space if the set of all its isolated points is dense in the space. The main aim of the article is to show in $\mathbf{ZF}$ a new characterization of iso-dense spaces in terms of…

General Topology · Mathematics 2024-04-11 Tom Richmond , Eliza Wajch

We make some general observations about partial orders on quotient spaces, and explore their use in music theory, in two different contexts. In the first, we show that many of the most familiar chord and scale types in Western music appear…

General Mathematics · Mathematics 2012-11-02 Marcus Pendergrass

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

Dynamical Systems · Mathematics 2015-09-29 Alan Haynes , Henna Koivusalo , James Walton

For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has there been renewed interest in the fundamental principles underlying this paradigm. In this paper, we present a…

Artificial Intelligence · Computer Science 2009-09-25 S. Minton , J. Bresina , M. Drummond

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo
‹ Prev 1 2 3 10 Next ›