Related papers: On LP-orientations of cubes and crosspolytopes

Let $K$ be a composite field of some real quadratic fields. We give a sufficient condition on $K$ such that all elliptic curves over $K$ is modular.

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…

Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown…

We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.

Consider a compact Lie group and a closed subgroup. Generalizing a result of Klyachko, we give a necessary and sufficient criterion for a coadjoint orbit of the subgroup to be contained in the projection of a given coadjoint orbit of the…

This thesis captures the ongoing development of twisted cubes, which is a modification of cubes (in a topological sense) where its homotopy type theory does not require paths or higher paths to be invertible. My original motivation to…

We complete the `paraxial' (small-angle) ray optics cloaking formalism presented previously [Choi and Howell, Opt. Express 22, 29465 (2014)], by extending it to the full-field of light. Omnidirectionality is then the only relaxed parameter…

In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of…

We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric.…

In this paper, we provide conditions which are sufficient to form composite wavelet frames on the Hilbert space of Euclidean space over R^n

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…

We establish optimal conditions under which the G-convergence of linear elliptic operators implies the convergence of the corresponding Dirichlet to Neumann maps. As an application we show that the approximate cloaking isotropic materials…

We prove a general theorem on the existence of heteroclinic orbits in Hilbert spaces, and present a method to reduce the solutions of some P.D.E. problems to such orbits. In our first application, we give a new proof in a slightly more…

Statements analogous to the Hard Lefschetz Theorem (HLT) and the Hodge-Riemann bilinear relations (HRR) hold in a variety of contexts: they impose restrictions on the cohomology algebra of a smooth compact K\"ahler manifold or on the…

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

Take finitely many topological spaces and for each pair of these spaces choose a pair of corresponding closed subspaces that are identified by a homeomorpism. We note that this gluing procedure does not guarantee that the building pieces,…

Let S be a smooth real surface in C^2 and let p\in S be a point at which the tangent plane is a complex line. How does one determine whether or not S is locally polynomially convex at such a p --- i.e. at a CR singularity ? Even when the…