arXiv research

Flow deforms locally convex curves to curves of constant k-order width.

Using the reviewed Riemann-Liouville fractional derivative we introduce the fractional osculator Lagrange space of k order and the main structures on it. The results are applied at the k order fractional prolongation of Lagrange, Finsler and Riemann fractional structures.

In this paper, we obtain the sharp $k$-th order Sobolev inequalities in the hyperbolic space ${\H}^n$ for all $k=1,2,3,\cdots$. This gives an answer to an open question raised by Aubin in [5, p.$\;$176-177] for $W^{k,2}({\H}^n)$ with $k>1$. In addition, we prove that the associated Sobolev constants are optimal.

A number of results for C$^2$-smooth surfaces of constant width in Euclidean 3-space ${\mathbb{E}}^3$ are obtained. In particular, an integral inequality for constant width surfaces is established. This is used to prove that the ratio of volume to cubed width of a constant width surface is reduced by shrinking it along…

We present an alternative proof of the following fact: the hyperspace of compact closed subsets of constant width in $\mathbb R^n$ is a contractible Hilbert cube manifold. The proof also works for certain subspaces of compact convex sets of constant width as well as for the pairs of compact convex sets of constant rela…

We prove that among all constant width bodies of revolution, the minimum of the ratio of the volume to the cubed width is attained by the constant width body obtained by rotation of the Reuleaux triangle about an axis of symmetry.

In 1926 S. Nakajima (= A. Matsumura) showed that any convex body in $\R^3$ with constant width, constant brightness, and boundary of class $C^2$ is a ball. We show that the regularity assumption on the boundary is unnecessary, so that balls are the only convex bodies of constant width and brightness.

Let n be a natural number equal or greater than 2. In this paper we study the topological structure of certain hyperspaces of convex subsets of constant width, equipped with the Hausdorff metric topology. We focus our attention on the hyperspace cw_D(R^n) of all compact convex subsets with constant width d\in D, where …

This paper focuses on curves and surfaces of constant width, with some additional results about general ovals. We emphasize the use of Fourier series to derive properties, some of which are known. Amongst other results, we show that the perimeter of an oval is $π$ times its average width, and provide a bound for the ra…

Study on spherical bodies of constant width on the unit sphere, proving bounds on their relative effective radius.

A Riemannian n-manifold M has k-dimensional Uryson width bounded by a constant c >0 if there exists a continuous map f from M to an k-dimensional polyhedral space P, such that the pullbacks f^{-1}(p) of all points p in P have diameters bounded by c. We prove that an n-dimensional Riemannian manifold M with at least n-k…

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…

Improved neural network depth-width trade-offs via dynamical systems.

Study bounds Urysohn width of manifolds under surgeries.

There are many "minimax" complexity functions in mathematics: width of a tree or a link, Heegaard genus of a 3-manifold, the Cheeger constant of a Riemannian manifold. We define such a function w, "width", on countable (or finite) groups and show w(Z^k) = k-1.

Adversarial examples in deep ReLU networks with constant depth.

New insights into $p$-widths of surfaces, proving optimality and calculating constants.

In this paper we study properties of the area evolute (AE) and the center symmetry set (CSS) of a convex planar curve $γ$. The main tool is to define a Minkowski plane where $γ$ becomes a constant width curve. In this Minkowski plane, the CSS is the evolute of $γ$ and the AE is an involute of the CSS. We prove that the…

Develops a new theory of width for embedded circles in Riemannian manifolds.

If $(M^n, g)$ is a closed Riemannian manifold where every unit ball has volume at most $ε_n$ (a sufficiently small constant), then the $(n-1)$-dimensional Uryson width of $(M^n, g)$ is at most 1.

In this paper we introduce the Constant Width Measure Set, which measures the constant width property of an oval, i.e. the planar simple closed strictly convex curve. We study its geometrical properties. We find the exact relation between the length and the area of the region bounded by an oval $M$. Namely, the followi…

New optimizers control network width scaling, improving stability and transfer across different model sizes.

This paper optimizes ReLU networks for approximating Hölder continuous functions.

New framework connects two neural network theories, improving finite-width approximations.

We provide an upper bound for the Gromov width of compact homogeneous Hodge manifolds $(M, ω)$ with $b_2(M)=1$. As an application we obtain an upper bound on the Seshadri constant $ε(L)$ where $L$ is the ample line bundle on $M$ such that $c_1(L)=[\fracωπ]$.

This paper studies bounds for the Lipschitz constant of random neural networks.

We give a simple procedure to estimate the smallest Lipshitz constant of a degree 1 map from a Riemannian 2-sphere to the unit 2-sphere, up to a factor of 10. Using this procedure, we are able to prove several inequalities involving this Lipshitz constant. For instance, if the smallest Lipshitz constant is at least 1, …

Logarithmic network width suffices for robust memorization.

The width of a closed convex subset of Euclidean space is the distance between two parallel supporting planes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still open in dimension n > 2. In this paper we describe a necessary condition that th…

In [6] we proved Chen's inequality regarded as a problem of constrained maximum. In this paper we introduce a Riemannian invariant obtained from Chen's invariant, replacing the sectional curvature by the Ricci curvature of k-order. This invariant can be estimated, in the case of submanifolds M in space forms $\widetild…

Wider neural networks perform better than deeper ones with the same number of parameters.

Given a 2-dimensional surface M and a constant C we construct a Riemannian metric g, so that diameter diam(M,g)=1 and every 1-cycle dividing M into two regions of equal area has length >C. It follows that there exists no universal inequality bounding 1-width of M in terms of its diameter. This answers a question of Ste…

Sine activation functions enable two-layer neural networks to learn modular addition more efficiently.

New framework for understanding infinite-width neural networks.

Wide neural networks become linear, with constant tangent kernel, due to Hessian scaling.

Proof of learning rate transfer in MLPs with $μ$P parameterization.

Find simple geodesics in hyperbolic surfaces with bounded diameter.

Given a Riemannian metric on a homotopy $n$-sphere, sweep it out by a continuous one-parameter family of closed curves starting and ending at point curves. Pull the sweepout tight by, in a continuous way, pulling each curve as tight as possible yet preserving the sweepout. We show: Each curve in the tightened sweepout …

Given a normed plane $\mathcal{P}$, we call $\mathcal{P}$-cycloids the planar curves which are homothetic to their double $\mathcal{P}$-evolutes. It turns out that the radius of curvature and the support function of a $\mathcal{P}$-cycloid satisfy a differential equation of Sturm-Liouville type. By studying this equati…

New approach finds minimum width for deep, narrow MLPs.

Quantitative CLTs show neural network distributions converge to Gaussian as width increases.

Establish optimal Lipschitz lower bounds for functions on manifolds with negative curvature, revealing interplay between width, boundary area, and topology.

The paper explores connections between perimeter, area, and visual angle of convex sets.

ResNets approximate log-Gaussian at initialization, improving network performance.

Study shows polynomial-width neural networks can closely approximate infinite-width networks in polynomial time.

Study of deep linear neural networks with proportional width and depth.

Recently, the Weisfeiler-Lehman (WL) graph isomorphism test was used to measure the expressive power of graph neural networks (GNN). It was shown that the popular message passing GNN cannot distinguish between graphs that are indistinguishable by the 1-WL test (Morris et al. 2018; Xu et al. 2019). Unfortunately, many s…

Study on curvature bounds for specific hypersurfaces in Anti-de Sitter space.