Related papers: Approval Ballot Triangles and Strict-Sense Ballots

An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies…

In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…

We classify subsystem symmetry-protected topological (SSPT) phases in $3+1$D protected by planar subsystem symmetries, which are dual to abelian fracton topological orders. We distinguish between weak SSPTs, which can be constructed by…

A $3$-$tangle$ $T$ is the disjoint union of $3$ properly embedded arcs in the unit 3-ball; it is called rational if there is a homeomorphism of pairs from $(B^3,T)$ to $(D^2\times I,\{x_1,x_2,x_3\}\times I)$. Two rational 3-tangles $T$ and…

We investigate binary voting systems with two types of voters and a hierarchy among the members in each type, so that members in one class have more influence or importance than members in the other class. The purpose of this paper is to…

This work examines the Conditional Approval Framework for elections involving multiple interdependent issues, specifically focusing on the Conditional Minisum Approval Voting Rule. We first conduct a detailed analysis of the computational…

We survey a host of results from discrete geometry that have bearing on the analysis of geometric models of approval voting. Such models view the political spectrum as a geometric space, with geometric constraints on voter preferences.…

A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.

Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems…

Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserting a segment amounts to: (1) deleting all the triangles it…

We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allocated memory. This logic provides a language for…

In this paper, based on results of exact learning and test theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined…

ELECTRE TRI-nB is a method designed to sort alternatives evaluated on several attributes into ordered categories. It is an extension of ELECTRE TRI-B, using several limiting profiles, instead of just one, to delimit each category. ELECTRE…

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…

We ask when a finite set of t-structures in a triangulated category can be `averaged' into one t-structure or, equivalently, when the extension closure of a finite set of aisles is again an aisle. There is a straightforward, positive answer…

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…