相关论文: Gerechte Designs with Rectangular Regions
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
A standard objective in computer experiments is to approximate the behaviour of an unknown function on a compact domain from a few evaluations inside the domain. When little is known about the function, space-filling design is advisable:…
The developable surface is an important surface in computer aided design, geometric modeling and industrial manufactory. It is often given in the stan- dard parametric form, but it can also be in the implicit form which is commonly used in…
We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \emph{stable} if any map from $S$ to unitaries that approximately satisfies…
We give a $K$-theoretic realization of all affine Hecke algebras with two unequal parameters including exceptional types. This extends the celebrated work of Kazhdan and Lusztig, who gave a $K$-theoretic realization of affine Hecke algebras…
This paper introduces calibrated representations for affine Hecke algebras and classifies and constructs all finite dimensional irreducible calibrated representations. The primary technique is to provide indexing sets for controlling the…
A rectangular floorplan is a partition of a rectangle into smaller rectangles such that no four rectangles meet at a single point. Rectangular floorplans arise naturally in a variety of applications, including VLSI design, architectural…
A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…
Call a pure Hodge structure geometric if it is contained in the cohomology of a smooth complex projective variety. The main goal is to show that for any set of Hodge numbers (subject to the obvious constraints), there exists a geometric…
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…
A metric space $\mathcal{T}$ is a \emph{real tree} if for any pair of points $x, y \in \mathcal{T}$ all topological embeddings $\sigma$ of the segment $[0,1]$ into $\mathcal{T}$, such that $\sigma (0)=x$ and $\sigma (1)=y$, have the same…
This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
We construct a model structure on simplicial profinite sets such that the homotopy groups carry a natural profinite structure. This yields a rigid profinite completion functor for spaces and pro-spaces. One motivation is the \'etale…
Fair representations are a powerful tool for establishing criteria like statistical parity, proxy non-discrimination, and equality of opportunity in learned models. Existing techniques for learning these representations are typically…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…
High-level synthesis, source-to-source compilers, and various Design Space Exploration techniques for pragma insertion have significantly improved the Quality of Results of generated designs. These tools offer benefits such as reduced…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
The purpose of this paper is to verify a conjecture of Gross under mild hypothesis: all reduced, separated, and excellent schemes have the resolution property away from a closed subset of codimension at least three. Our technique uses…