相关论文: Covering all but the low weight vertices of the un…

Motivated by classical work of Alon and F\"uredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $\mathbb{R}^d$ needed to cover every point of the triangular grid $T_d(n) :=…

Given a minimal surface equipped with a generically finite map to an Abelian variety, we give an optimal bound on the canonical degree of a rational or an elliptic curve. As a corollary, we obtain the finiteness of rational and elliptic…

The classical Lusternik-Schnirelman-Borsuk theorem states that if a d-sphere is covered by d+1 closed sets, then at least one of the sets must contain a pair of antipodal points. In this paper, we prove a combinatorial version of this…

For compact Riemann surfaces, the collar theorem and Bers' partition theorem are major tools for working with simple closed geodesics. The main goal of this paper is to prove similar theorems for hyperbolic cone-surfaces. Hyperbolic…

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if for every vertex in $G$ there is a copy of $F$ covering it. For $1\leq i\leq k-1$, the minimum $i$-degree $\delta_i(G)$ of $G$ is the minimum integer such…

Consider the algebraic function $\Phi_{g,n}$ that assigns to a general $g$-dimensional abelian variety an $n$-torsion point. A question first posed by Kronecker and Klein asks: What is the minimal $d$ such that, after a rational change of…

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

The Severi variety parameterizes plane curves of degree d with delta nodes. Its degree is called the Severi degree. For large enough d, the Severi degrees coincide with the Gromov-Witten invariants of P^2. Fomin and Mikhalkin (2009) proved…

An essential cover of the vertices of the $n$-cube $\{0,1\}^n$ by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of at least one hyperplane. Linial and Radhakrishnan gave a…

By Hartman--Nirenberg's theorem, any complete flat hypersurface in Euclidean space must be a cylinder over a plane curve. However, if we admit some singularities, there are many non-trivial examples. Flat fronts are flat hypersurfaces with…

We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.

Let $Q_n$ be the cube of side length one centered at the origin in $\mathbb{R}^n$, and let $F$ be an affine $(n-d)$-dimensional subspace of $\mathbb{R}^n$ having distance to the origin less than or equal to $\frac 1 2$, where $0<d<n$. We…

We construct algebraic surfaces with a large number of type A singularities. Bivariate polynomials presented in previous works for the construction of nodal surfaces and certain families of Belyi polynomials are used. In some cases explicit…

We classify entire 2-dimensional area-minimizing or stable surfaces in R^4 with quadratic area growth as algebraic, cut out by a finite union of holomorphic polynomials whose collective degrees are controlled by the density at infinity. As…

A very general surface of degree at least four in projective space of dimension three contains no curves other than intersections with surfaces. We find a formula for the degree of the locus of surfaces of degree at least five which contain…

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

Choose a polynomial in three variables with not more than three or four monomials of moderate degree. Take simple coefficients as 1 and -1. Then draw a picture of the solution variety in real three space using a ray-tracing program like…

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…

In the present paper we find a bijection between the set of small covers over an $n$-cube and the set of acyclic digraphs with $n$ labeled nodes. Using this, we give a formula of the number of small covers over an $n$-cube (generally, a…

We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…