Related papers: Generalised Barred Preferential Arrangements
We suggest modified bi-level approach for finding the best stacking sequence of laminated composite structures subject to mechanical, blending and manufacturing constraints. We propose to use both the number of plies laid up at predefined…
We study some aspects of divisionally free arrangements which were recently introduced by Abe. Crucially, Terao's conjecture on the combinatorial nature of freeness holds within this class. We show that while it is compatible with products,…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
We present a class of orderings L for which there exists a profile u of preferences for a fixed odd number of individuals such that Borda's rule maps u to L.
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…
We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the…
Goods and services -- public housing, medical appointments, schools -- are often allocated to individuals who rank them similarly but differ in their preference intensities. We characterize optimal allocation rules when individual…
Because preferences naturally arise and play an important role in many real-life decisions, they are at the backbone of various fields. In particular preferences are increasingly used in almost all matching procedures-based applications. In…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
To enhance the performance of the recommender system, side information is extensively explored with various features (e.g., visual features and textual features). However, there are some demerits of side information: (1) the extra data is…
In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
Let G be a graph with a list assignment L. Suppose a preferred color is given for some of the vertices; how many of these preferences can be respected when L-coloring G? We explore several natural questions arising in this context, and…
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…
We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…