In this work, we investigate wave transmission property through a zero index metamaterial (ZIM) waveguide embedded with rectangular dielectric defects. We show that total reflection and total transmission (cloaking) can be achieved by adjusting the geometric sizes and/or permittivities of the defects. Our work provides another possibility of manipulating wave propagation through ZIM in addition to the widely studied dielectric defects with cylindrical geometries.

We construct a generalization of twistor spaces of hypercomplex manifolds and hyper-Kahler manifolds M, by generalizing the twistor P1 to a more general complex manifold Q. The resulting manifold X is complex if and only if Q admits a holomorphic map to P1. We make branched double covers of these manifolds. Some class of these branched double covers can give rise to non-Kahler Calabi-Yau manifolds. We show that these manifolds X and their branched double covers are non-Kahler. In the cases that Q is a balanced manifold, the resulting manifold X and its special branched double cover have balanced Hermitian metrics.

Geometric compression plays a fundamental rolein virtual reality and augmented reality (VR/AR) applications. Dense meshesare re-sampled and re-tessellatedtoreduce thecomplexity. This process is called remeshing. In this work,we propose a novel remeshing algorithm based on both angle-preservingparameterization, and measurecontrollable parameterization. The conformal parameterization iscarried out by discrete surface Ricci flow method, the measurecontrollable parameterization is obtaind by an optimal mass transportation map. The sampling is performed on the measurecontrollable parameterization domain, the triangulation is computed on the conformal parameterization domain using Delaunay refinement algorithm. This method gives the user full control of sampling distribution, and produces mesheswith curvature measure convergence. The meshing resultcan emphsizethe region of interests, is curvature sensitive. Experimental results demonstrate the efficiency and efficacy of the proposed method.

No abstract uploaded!

In this paper, we try to clarify some of the questions related to a key concept in multivariate polynomial solving algorithm over a finite field: the degree of regularity. By the degree of regularity, here we refer to a concept first presented by Dubois and Gama, namely the lowest degree at which certain nontrivial degree drop of a polynomial system occurs. Currently, it is somehow commonly accepted that we can use this degree to estimate the complexity of solving a polynomial system, even though we do not have systematic empirical data or a theory to support such a claim. In this paper, we would like to clarify the situation with the help of experiments. We first define a concept of solving degree for a polynomial system. The key question we then need to clarify is the connection of solving degree and the degree of regularity with focus on quadratic systems. To exclude the cases that do not represent the general situation, we need to define when a system is degenerate and when it is irreducible. With extensive computer experiments, we show that the two concepts, the degree of regularity and the solving degree, are related for irreducible systems in the sense that the difference between the two degrees is indeed small, less than 3. But due to the limitation of our experiments, we speculate that this may not be the case for high degree cases.