相关论文: A proof of the generalized geometric boundary theo…

We give a short proof of Szemer\'edi's regularity lemma, based on elementary Euclidean geometry. The general line of the proof is that of the standard proof (in fact, of Szemer\'edi's original proof), but most technicalities are swallowed…

Let $\Sigma$ be a bounded surface. We prove the Dehn-Nielsen-Baer theorem for bounded surfaces to show that the mapping class group of $\Sigma$ is isomorphic to the automorphisms of the fundamental groupoid of $\Sigma$ that fix loops around…

We explore the algebraic properties of a generalized version of the iterated-sums signature, inspired by previous work of F.~Kir\'aly and H.~Oberhauser. In particular, we show how to recover the character property of the associated linear…

In this paper, we prove a generalization of Green's Hyperplane Restriction Theorem to the case of modules over the polynomial ring, providing in particular an upper bound for the Hilbert function of the general linear restriction of a…

A new generalization of the classical separate algebraicity theorem is suggested and proved.

We formulate a refined theory of linear systems, using the methods of a previous paper, "A Theory of Branches for Algebraic Curves", and use it to give a geometric interpretation of the genus of an algebraic curve. Using principles of…

We develop some foundations for the theory of formal derived algebraic geometry, which parallel the theory of formal spectral algebraic geometry by Jacob Lurie. For this, we establish a close connection between algebro-geometric objects in…

We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more…

We generalize the Griesmer bound in the case of systematic codes over a field of size q greater than the distance d of the code. We also generalize the Griesmer bound in the case of any systematic code of distance 2,3,4 and in the case of…

We construct and justify leading order weakly nonlinear geometric optics expansions for nonlinear hyperbolic initial value problems, including the compressible Euler equations. The technique of simultaneous Picard iteration is employed to…

Deep nets generalize well despite having more parameters than the number of training samples. Recent works try to give an explanation using PAC-Bayes and Margin-based analyses, but do not as yet result in sample complexity bounds better…

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…

We prove the boundedness of $n$-complements for surface pairs in a generalized case without restrictions on multiplicities or the Fano type assumption.

We show that Generic Green's conjecture holds for generic binary curves, through a detailed analysis of the family of scrolls containing fixed rational normal curves.

The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations and the edge metric dimension of generalized Petersen graphs…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

The physical consistency of the match of piecewise-$C^0$ metrics is discussed. The mathematical theory of gravitational discontinuity hypersurfaces is generalized to cover the match of regularly discontinuous metrics. The mean-value…

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable…