Related papers: A Simple Optimal Binary Representation of Mosaic F…
A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We…
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
Recently, a new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced. The mathematical background goes back to the regular mosaics in the hyperbolic plane. In this article, we investigate the paths…
The family of complex projective surfaces in projective three space of degree $d$ having precisely $\delta$ nodes as their only singularities has codimension $\delta$ in the linear system of surfaces of degree $d$ for sufficiently large $d$…
For conformal field theories in arbitrary dimensions, we introduce a method to derive the conformal blocks corresponding to the exchange of a traceless symmetric tensor appearing in four point functions of operators with spin. Using the…
We present a novel method to estimate the motion matrix between overlapping pairs of 3D views in the context of indoor scenes. We use the Manhattan world assumption to introduce lightweight geometric constraints under the form of planes…
We study equivalence, in the context of a variable diffusion problem, between (conforming) mixed methods and (primal) nonconforming methods defined on potentially general polytopal partitions. In this first paper of a series of two, we…
In scattered data approximation, the span of a finite number of translates of a chosen radial basis function is used as approximation space and the basis of translates is used for representing the approximate. However, this natural choice…
Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…
We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
Plane partitions naturally appear in many problems of statistical physics and quantum field theory, for instance, in the theory of faceted crystals and of topological strings on Calabi-Yau threefolds. In this paper a connection is made…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…