We introduce a model concerning radiational gaseous stars and establish the existence theory of stationary solutions to the free boundary problem of hydrostatic equations describing the radiative equilibrium. We also establish in the spherically symmetric case the local well-posedness of the moving boundary problem of the corresponding Navier--Stokes--Fourier--Poisson system and construct a priori estimates of strong and classical solutions. Our results explore the vacuum behavior of density and temperature near the free boundary for the equilibrium and capture such degeneracy in the evolutionary problem.

Lecture notes : Introduction to Cyclic Covers in Algebraic Geometry

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

The goal of urban building mesh simplification is to generate a compact representation of a building from a given mesh. Local smoothness and sharp contours of urban buildings are important features for converting unstructured data into solid models, which should be preserved during the simplification. In this paper, we present a general method to filter and simplify 3D building mesh models, capable of preserving piecewise planar structures and sharp features. Given a building mesh model, a mesh filtering technique is firstly designed to yield piecewise planar regions and extract crease contours. The planar regions are used to constrain the simplification of the mesh. Mesh decimation is achieved through a series of edge collapse operations, which uses regional structural constraints and local geometric error metrics to handle planar and non-planar areas respectively. The proposed method preserves the mesh structure with meaningful levels of detail while reducing the number of faces. The effectiveness of this method is evaluated on various building models generated from different observation scales, and the performance is validated by extensive comparisons to state-of-the-art techniques.

No abstract uploaded!

We construct an enhanced version of knot contact homology, and show that we can deduce from it the group ring of the knot group together with the peripheral subgroup. In particular, it completely determines a knot up to smooth isotopy. The enhancement consists of the (fully noncommutative) Legendrian contact homology associated to the union of the conormal torus of the knot and a disjoint cotangent fiber sphere, along with a product on a filtered part of this homology. As a corollary, we obtain a new, holomorphiccurve proof of a result of the third author that the Legendrian isotopy class of the conormal torus is a complete knot invariant.

As the barcode becomes more widely used, its applications and data capacity demands grow, increasing the need for barcodes with greater data density. Utilizing the quick response (QR) code–one of the many types of barcodes–we developed two algorithms. The first algorithm creates a color QR code that stores more information than a standard QR code and embeds extra data with limited access privilege. The second algorithm denoises a noisy color QR code. These algorithms consist of three techniques: (1) enlarging the data capacity of a compact QR code image by stacking multiple classical QR codes to form a color barcode, (2) embedding information into the color QR code using pseudo quantum signals in an M-band wavelet domain and selecting the discrete 4-band wavelet transforms to compress the QR images, and (3) applying Discrete M-band Wavelet Transform (DMWT) and Patch Group Prior based Denoising (PGPD) methods to denoise noisy QR code images. The peak-signal-to-noise-ratio (PSNR) summary indicates that information in a color QR code can be efficiently stored and retrieved with these methods. Moreover, it shows that our denoising algorithm effectively removes heavy noise from the noisy color QR code. Our algorithms are implemented in a flexible framework, which allows for further modifications to improve both the data capacity of a color QR code and the effectiveness of signal extraction from noisy data to meet future demands.

No abstract uploaded!

No abstract uploaded!

We prove that the 2-primary $pi_{61}$ is zero. As a consequence, the Kervaire invariant element $\theta_5$ is contained in the strictly defined 4-fold Toda bracket $\langle 2, \theta_4, \theta_4, 2 \rangle$. Our result has a geometric corollary: the 61-sphere has a unique smooth structure and it is the last odd dimensional case — the only ones are $S^1, S^3, S^5$ and $S^{61}$. Our proof is a computation of homotopy groups of spheres. A major part of this paper is to prove an Adams differential $d_3(D_3) = B_3$. We prove this differential by introducing a new technique based on the algebraic and geometric Kahn-Priddy theorems. The success of this technique suggests a theoretical way to prove Adams differentials in the sphere spectrum inductively by use of differentials in truncated projective spectra.

No abstract uploaded!

No abstract uploaded!

Polyhedral combinatorics has been a topic of interest in modern day’s computational geometry. The founding of Steinitz’s Theorem in 1922 revealed consequential relations between graph theory and polyhedral combinatorics. It allows us to better investigate on the topology of convex polyhedrons. In this paper, we proposed an algorithm that generates a unique sequence of points, using the vertices of a triangulated polyhedron, pre-determined by the selection of the starting 3 vertices in the sequence. Following that, we discover an interesting relation between the sequence and the volume of the polyhedron itself, in which we presented in the form of a sufficient condition. To further investigate which polyhedrons generate sequences that satisfy the sufficient condition, we study the problem in the context of graph theory, that is, the explorer walk (corresponding to the sequence of vertices) in maximal planar graphs (skeletons of triangulated convex polyhedrons). With that, we uncovered a family of maximal planar graphs, called the explorer graphs, which exhibits volumetric properties in the polyhedrons constructed from them, in regard to the explorer walk. In this paper, we also introduce generalized methods of constructing explorer graphs of higher order from explorer graphs of lower order, demonstrating the prevalence of explorer graphs. As the edges of a maximal planar graph is of great importance in tracing an explorer walk, we investigate on the line graph of maximal planar graphs, and re-establish a better definition of explorer graphs. Lastly, our paper covers the edge contraction of explorer graphs, which allows us to solve the volume of polyhedrons constructed from non-explorer graphs. For this, we presented a possible bound for the minimum number of edge contractions a non-explorer graph requires from an explorer graph. This will generalize the proposed method of finding volumes to any triangulated convex polyhedron.

No abstract uploaded!

In this paper we discuss the change in contact structures as their supporting open book decompositions have their binding components cabled. To facilitate this and applications we define the notion of a rational open book decomposition that generalizes the standard notion of open book decomposition and allows one to more easily study surgeries on transverse knots. As a corollary to our investigation we are able to show there are Stein fillable contact structures supported by open books whose monodromies cannot be written as a product of positive Dehn twists. We also exhibit several monoids in the mapping class group of a surface that have contact geometric significance.

In 1976, Thurston proved that taut foliations on closed hyperbolic 3-manifolds have Euler class of norm at most 1, and conjectured that conversely, any integral second cohomology class with norm equal to one is the Euler class of a taut foliation. This is the first from a series of two papers that together give a negative answer to Thurston’s conjecture. Here counter-examples have been constructed conditional on the fully marked surface theorem. In the second paper, joint with David Gabai, a proof of the fully marked surface theorem is given.

Ricci flow deformsthe Riemannian metric proportionallyto the curvature, such that the curvatureevolves accordingto a heat diffusion process and eventually becomes constant everywhere. Ricci flow has demonstrated its great potential by solving various problems in many fields, which can be hardly handled by alternative methods so far. This work introduces the unified theoretic framework for discrete Surface Ricci Flow, including all the common schemes: Tangential Circle Packing, Thurston’s Circle Packing, Inversive Distance Circle Packing and Discrete Yamabe Flow. Furthermore, this work also introduces a novel schemes, Virtual Radius Circle Packing and the Mixed Type schemes, under the unified framework. This work gives explicit geometric interpretation to the discrete Ricci energies for all the schemes with all back ground geometries, and the corresponding Hessian matrices. The unified frame work deepens our understanding to the the discrete surface Ricci flow theory, and has inspired us to discover the new schemes, improved the flexibility and robustness of the algorithms, greatly simplified the implementation and improved the efficiency. Experimental results show the unified surface Ricci flow algorithms can handle general surfaces with different topologies, and is robust to meshes with different qualities, and is effective for solving real problems.

Finite difference WENO schemes have established themselves as very worthy performers for entire classes of applications that involve hyperbolic conservation laws. In this paper we report on two major advances that make finite difference WENO schemes more efficient.