Related papers: Construction Techniques for Linear Realizations of…
The Harary-Hill conjecture states that for every $n>0$ the complete graph on $n$ vertices $K_n$, the minimum number of crossings over all its possible drawings equals \begin{align*} H(n) :=…
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing…
Let $S$ be a finite set of positive integers. A mixed hypergraph ${\cal H}$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is either 0 or 1. In [P. Zhao, K. Diao, Y. Chang and K. Wang, The…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
For certain real quadratic fields $K$ with sufficiently small discriminant we produce explicit unit generators for specific ray class fields of $K$ using a numerical method that arose in the study of complete sets of equiangular lines in…
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…
We consider a finite collection of line bundles $\Phi$ introduced by Bondal on a smooth, projective toric variety $X$. For any coherent sheaf $F$ on $X$, we construct minimal resolutions of $F$ by line bundles in $\Phi$, up to twist, with…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been…
The linear algorithm of the Wiener filter and constrained realizations (CRs) of Gaussian random fields is extended here to perform non-linear CRs. The procedure consists of: (1) Using low resolution data to constrain a high resolution…
Let $\epsilon>0$. We consider the problem of constructing a Hamiltonian graph with $(1+\epsilon)n$ edges in the following controlled random graph process. Starting with the empty graph on $[n]$, at each round a set of $K=K(n)$ edges is…
Given an n-dimensional substitution whose associated linear expansion is unimodular and hyperbolic, we use elements of the one-dimensional integer \v{C}ech cohomology of the associated tiling space to construct a finite-to-one…
Graph summarization is beneficial in a wide range of applications, such as visualization, interactive and exploratory analysis, approximate query processing, reducing the on-disk storage footprint, and graph processing in modern hardware.…
We characterize the sets of norm one vectors $\mathbf{x}_1,\ldots,\mathbf{x}_k$ in a Hilbert space $\mathcal H$ such that there exists a $k$-linear symmetric form attaining its norm at $(\textbf{x}_1,\ldots,\mathbf{x}_k)$. We prove that in…
In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\ge 3$, if $H$ is a $k$-graph on $n\in k\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least…
We study the relationship between several constructions of symplectic realizations of a given Poisson manifold. Our main result is a general formula for a formal symplectic realization in the case of an arbitrary Poisson structure on…
Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…
An {\em $\ell$-offset Hamilton cycle} $C$ in a $k$-uniform hypergraph $H$ on~$n$ vertices is a collection of edges of $H$ such that for some cyclic order of $[n]$ every pair of consecutive edges $E_{i-1},E_i$ in $C$ (in the natural ordering…