Related papers: Oda's conjecture for reflexive polytopes: some spe…

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…

Let Q be a nondegenerate quadratic form, and L is a nonzero linear form of dimension d>3. As a generalization of the Oppenheim conjecture, we prove that the set {(Q(x),L(x)):x\in Z^d} is dense in R^2 provided that Q and L satisfy some…

Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…

We complete the proof of Oka's conjecture on the Alexander polynomial of an irreducible plane sextic. We also calculate the fundamental groups of irreducible sextics with a singular point adjacent to $J_{10}$.

If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

This thesis concerns the algebraic consequences of Freyd's Generating Hypothesis, and explores the question of whether there exists a self-injective ring R that can be constructed purely algebraically that exhibits some of the known…

In this work we are interested in the Demyanov--Ryabova conjecture for a finite family of polytopes. The conjecture asserts that after a finite number of iterations (successive dualizations), either a 1-cycle or a 2-cycle eventually comes…

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

We prove a few results concerning the notions of finite dimensionality of mixed Tate motives in the sense of Kimura and O'Sullivan. It is shown that being oddly or evenly finite dimensional is equivalent to vanishing of certain cohomology…

Following an idea of Ishida, we develop polynomial equations for certain unramified double covers of surfaces with p_g=q=1 and K^2=2. Our first main result provides an explicit surface surface X with these invariants defined over Q that has…

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

Let $M$ be a finitely generated module over a ring $\Lambda$. With certain mild assumptions on $\Lambda$, it is proven that $M$ is a reflexive $\Lambda$-module, once $M \cong M^{**}$ as a $\Lambda$-module.

In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…