相关论文: Gerechte Designs with Rectangular Regions
We study fair division of divisible goods under generalized assignment constraints. Here, each good has an agent-specific value and size, and every agent has a budget constraint that limits the total size of the goods she can receive. Since…
The projective space of order $n$ over the finite field $\Fq$, denoted here as $\Ps$, is the set of all subspaces of the vector space $\Fqn$. The projective space can be endowed with distance function $d_S(X,Y) = \dim(X) + \dim(Y) -…
We present a semi-automated framework to construct and reason about programs in a deeply-embedded while-language. The while-language we consider is a simple computation model that can simulate (and be simulated by) Turing Machines with a…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
One fundamental consequence of a scheme $X$ being proper is that the functor classifying maps from $X$ to any other suitably nice scheme or algebraic stack is representable by an algebraic stack. This result has been generalized by…
Geometric relational embeddings map relational data as geometric objects that combine vector information suitable for machine learning and structured/relational information for structured/relational reasoning, typically in low dimensions.…
Let $X$ be any rational surface. We construct a tilting bundle $T$ on $X$. Moreover, we can choose $T$ in such way that its endomorphism algebra is quasi-hereditary. In particular, the bounded derived category of coherent sheaves on $X$ is…
The Finite Element Method (FEM) is a powerful computational tool for solving partial differential equations (PDEs). Although commercial and open-source FEM software packages are widely available, an independent implementation of FEM…
The design of algorithms for political redistricting generally takes one of two approaches: optimize an objective such as compactness or, drawing on fair division, construct a protocol whose outcomes guarantee partisan fairness. We aim to…
Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
\emph{Scalable spaces} are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their algebra of (flat) differential forms. This is a rational homotopy invariant property and all scalable spaces are…
In this paper, we explore the notion of a \emph{self-reachable} chip configuration on a simple graph, that is a chip configuration which can be re-obtained from itself after a (nonempty) sequence of vertex firings. In particular, we focus…
A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…
For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…
Region based knowledge graph embeddings represent relations as geometric regions. This has the advantage that the rules which are captured by the model are made explicit, making it straightforward to incorporate prior knowledge and to…
Finite-dimensional subalgebras of a Lie algebra of smooth vector fields on a circle, as well as piecewise-smooth global transformations of a circle on itself, are considered. A canonical forms of realizations of two- and three-dimensional…
A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…