Zobrazeno 1 - 10
of 49
pro vyhledávání: '"PULAJ, JONAD"'
Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be aggregated into a single preference that satisfies certain soundness properties. The celebrated Arr
Externí odkaz:
http://arxiv.org/abs/2409.04685
We present the notion of a multilevel, slashable quorum system, where an application can obtain gradual levels of assurance that a certain value is bound to be decided (or "finalized") in a global consensus procedure, unless a large number of Byzanti
Externí odkaz:
http://arxiv.org/abs/2405.08135
An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed mathematical formula. AMMs are typically implemented as smart contracts on blockchains, and its prices
Externí odkaz:
http://arxiv.org/abs/2401.04289
Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a gra
Externí odkaz:
http://arxiv.org/abs/2312.12618
Correctness of results from mixed-integer linear programming (MILP) solvers is critical, particularly in the context of applications such as hardware verification, compiler optimization, or machine-assisted theorem proving. To this end, VIPR 1.0 is t
Externí odkaz:
http://arxiv.org/abs/2312.10420
Autor:
Pulaj, Jonad, Wood, Kenan
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of $\mathcal{F}
Externí odkaz:
http://arxiv.org/abs/2301.01331
Publikováno v:
In Discrete Applied Mathematics 15 April 2024 347:155-174
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review of the linear ordering problem (LOP) and then use it to analyze the ra
Externí odkaz:
http://arxiv.org/abs/2104.05816
Feasible binary programs often have multiple optimal solutions, which is of interest in applications as they allow the user to choose between alternative optima without deteriorating the objective function. In this article, we present the optimal dia
Externí odkaz:
http://arxiv.org/abs/2008.06844
Autor:
Pulaj, Jonad
A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal{F} \subseteq 2^{[n]}$ such that $\mathcal{F} \neq \left\{\emptyset\ri
Externí odkaz:
http://arxiv.org/abs/1903.02317