Related papers: Symmetric binary Steinhaus triangles and parity-re…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM,…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Steiner and Schwarz symmetrizations, and their most important relatives, the Minkowski, Minkowski-Blaschke, fiber, inner rotational, and outer rotational symmetrizations, are investigated. The focus is on the convergence of successive…
Let S and T be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence S in one part and T in the other; equivalently, binary matrices with row sums S…
We study biharmonic maps and f-biharmonic maps from a round sphere $(S^2, g_0)$, the latter maps are equivalent to biharmonic maps from Riemann spheres $(S^2, f^{-1}g_0)$. We proved that for rotationally symmetric maps between rotationally…
A square matrix is called Hessenberg whenever each entry below the subdiagonal is zero and each entry on the subdiagonal is nonzero. Let $M$ denote a Hessenberg matrix. Then $M$ is called circular whenever the upper-right corner entry of…
Following a result of Hatori, Miura and Tagaki ([4]) we give here a spectral characterization of an isomorphism from a $C^\star$-algebra onto a Banach algebra. We then use this result to show that a $C^\star$-algebra $A$ is isomorphic to a…
We obtain several rigidity results for biharmonic submanifolds in $\mathbb{S}^{n}$ with parallel normalized mean curvature vector field. We classify biharmonic submanifolds in $\mathbb{S}^{n}$ with parallel normalized mean curvature vector…
A number which is either the square of an integer or two times the square of an integer is called squarish. There are two main results in the literature on graphs whose number of perfect matchings is squarish: one due to Jockusch (for…
A new method to obtain trigonometry for the real spaces of constant curvature and metric of any (even degenerate) signature is presented. The method encapsulates trigonometry for all these spaces into a single basic trigonometric group…
A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…
Let $d_1$, $d_2$, ... be a sequence of positive numbers that converges to zero. A generalization of Steinhaus' theorem due to Weil implies that, if a subset of a homogeneous Riemannian manifold has no pair of points at distances $d_1$,…
For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
R. Guralnick [Linear Algebra Appl. 99, 85-96 (1988)] proved that two holomorphic matrices on a noncompact connected Riemann surface, which are locally holomorphically similar, are globally holomorphically similar. In the preprints…
Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…
If a quantum walk starting on a vertex tends to stay at home, then that vertex is said to be sedentary. We prove that almost all planar graphs and almost all trees contain at least two sedentary vertices for any assignment of edge weights…