Analysis and synthesis of silhouettes of frontal - and flank-attacking shooting targets using graphs / Анализ и синтез силуэтов фронтальных и флангово-атакующих стрелковых мишеней с использованием графов / Analiza i sinteza silueta frontalnih i bočnih meta za gađanje pomoću grafova [PDF]
Vojnotehnički Glasnik, 2019 The goal of this contribution is to reveal the analytical framework and synthesis guidelines for frontal-attacking targets (FRATs) and flankattacking targets (FLATs) from the point of view of a graph as a mathematical object. The final outcome of this
Vadim L. Khaikov
doaj +1 more source
Chromatic symmetric functions from the modular law [PDF]
Journal of Combinatorial Theory, 2020 In this article we show how to compute the chromatic quasisymmetric function of indifference graphs from the modular law introduced by Guay-Paquet. We provide an algorithm which works for any function that satisfies this law, such as unicellular LLT ...
Alex Abreu, Antonio Nigro
semanticscholar +1 more source
The Total Chromatic Number of Reduced Indifference Graphs is the Maximum Degree Plus One
Sheila Morais de Almeida +2 more
openalex +2 more sources
A graph-theoretic framework for free-parafermion solvability [PDF]
Proceedings of the Royal Society AWe present a graph-theoretic characterization of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterization is based on the concept of a frustration graph, which represents the commutation relations ...
Ryan L. Mann +3 more
semanticscholar +1 more source
Size versus truthfulness in the House Allocation problem [PDF]
, 2019 We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects.
Krysta, Piotr +3 more
core +3 more sources
Quantum Computing and Hidden Variables I: Mapping Unitary to Stochastic Matrices [PDF]
, 2004 This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a stochastic matrix
C. Rovelli +11 more
core +2 more sources
Pareto Optimal Matchings in Many-to-Many Markets with Ties [PDF]
, 2015 We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses.
A Abdulkadiroǧlu +14 more
core +6 more sources
On the recognition of P4-indifferent graphs
Discrete Mathematics, 2001 A simple graph \(G=(V,E)\) is \(P_4\)-indifferent if it admits a total order \(
openaire +5 more sources
From Actual Evil to Possible Forgiveness: Three Positions on the Axes of Self and Other
Psychoanalytic Perspectives, 2023 This article focuses on three positions, from malignant to benign, located on the respective axes of object and subject in the context of forgiveness. A helpful graph is provided.
Dana Amir
semanticscholar +1 more source
Labour market screening with intermediaries [PDF]
, 2006 We consider a Rothschild-Stiglitz-Spence labour market screening model and employ a centralised mechanism to coordinate the efficient matching of workers to firms. This mechanism can be thought of as operated by a recruitment agency, an employment office
Schweinzer, Paul
core +2 more sources