Related papers: Desingularizations of some Weighted Projective Pla…
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…
We present a technique for computing explicit, concrete formulas for the weighted Bergman kernel on a planar domain with weight the modulus squared of a meromorphic function in the case that the meromorphic function has a finite number of…
This paper deals with numerical methods for reconstruction of inhomogeneous conductivities. We use the concept of Generalized Polarization Tensors, which were introduced in [3], to do reconstruction. Basic resolution and stability analysis…
Let $f \colon X \to X$ be a surjective endomorphism of a normal projective surface. When $\operatorname{deg} f \geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$.…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We study variations of Hodge structures over a Picard modular surface, and compute the weights and types of their degenerations through the cusps of the Baily-Borel compactification. The main tool is a theorem of Burgos and Wildeshaus.
We show that the tropical projective Grassmannian of planes is homeomorphic to a closed subset of the analytic Grassmannian in Berkovich's sense by constructing a continuous section to the tropicalization map. Our main tool is an explicit…
We use the techniques of birational algebraic geometry and some combinatorial arguments related to weighted trees to study the structure of resolutions of compactifications of hypothetical counterexamples to the two-dimensional Jacobian…
We survey the use of continued fraction expansions in the algebraical and topological study of complex analytic singularities. We also prove new results, firstly concerning a geometric duality with respect to a lattice between plane…
Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
We study exact decoding for the toric code and for planar and rotated surface codes under the standard independent \(X/Z\) noise model, focusing on Separate Minimum Weight (SMW) decoding and Separate Most Likely Coset (SMLC) decoding. For…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…
In this paper an extended CPR decomposition theorem for Finsler symmetric spaces of semi-negative curvature in the context of reductive structures is proven. This decomposition theorem is applied to give a geometric description of the…
We study surjective endomorphisms of projective bundles over toric varieties, achieving three main results. First, we provide a structural theorem describing endomorphisms of projectivized split bundles over arbitrary base varieties, which…
We propose a real-space renormalization group algorithm for accurately coarse-graining two-dimensional tensor networks. The central innovation of our method lies in utilizing variational boundary tensors as a globally optimized environment…
This paper presents an end-to-end differentiable algorithm for robust and detail-preserving surface normal estimation on unstructured point-clouds. We utilize graph neural networks to iteratively parameterize an adaptive anisotropic kernel…
Dantzig-Wolfe (DW) decomposition is a well-known technique in mixed-integer programming (MIP) for decomposing and convexifying constraints to obtain potentially strong dual bounds. We investigate cutting planes that can be derived using the…
We show that a weight variety, which is a quotient of a flag variety by the maximal torus, admits a flat degeneration to a toric variety. In particular, we show that the moduli spaces of spatial polygons degenerate to polarized toric…