English
Related papers

Related papers: Comparison between the non-crossing and the non-cr…

200 papers

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

General Mathematics · Mathematics 2021-08-23 Ryoji Fukuda

This paper proposes a method to address the longstanding problem of lack of monotonicity in estimation of conditional and structural quantile functions, also known as the quantile crossing problem. The method consists in sorting or monotone…

Methodology · Statistics 2017-10-04 Victor Chernozhukov , Ivan Fernandez-Val , Alfred Galichon

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

Operator Algebras · Mathematics 2009-01-26 Mihai Popa

We introduce in this paper an equivalence notion for submersions $U \to \R$, $U$ open in $\R^2$, which makes it possible to identify a smooth planar curve with a unique class of submersions. This idea, which extends to the nonlinear setting…

Systems and Control · Electrical Eng. & Systems 2020-04-22 Ricardo Riaza

For a widely-studied data model and general loss and sample-hardening functions we prove that the losses of Supervised Contrastive Learning (SCL), Hard-SCL (HSCL), and Unsupervised Contrastive Learning (UCL) are minimized by representations…

Machine Learning · Computer Science 2025-05-08 Ruijie Jiang , Thuan Nguyen , Shuchin Aeron , Prakash Ishwar

We study the class of norms on the space of smooth functions on a closed symplectic manifold, which are invariant under the action of the group of Hamiltonian diffeomorphisms. Our main result shows that any such norm that is continuous with…

Symplectic Geometry · Mathematics 2010-08-05 Lev Buhovsky , Yaron Ostrover

The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…

Machine Learning · Computer Science 2024-03-05 Teun D. H. van Nuland

We consider pinching cocycles taking values in the space of homeomorphisms of the circle over an hyperbolic base. Using the Invariance Principle of Malicet, we prove that the cocycles having non-zero exponents of contraction are dense. In…

Dynamical Systems · Mathematics 2022-12-27 Catalina Freijo , Karina Marin

We show that a continuous function on the analytification of a smooth proper algebraic curve over a non-archimedean field is subharmonic in the sense of Thuillier if and only if it is psh, i.e. subharmonic in the sense of Chambert-Loir and…

Algebraic Geometry · Mathematics 2018-11-09 Veronika Wanner

We consider the axial compression of a thin sheet wrapped around a rigid cylindrical substrate. In contrast to the wrinkling-to-fold transitions exhibited in similar systems, we find that the sheet always buckles into a single symmetric…

Soft Condensed Matter · Physics 2015-07-13 Norbert Stoop , Martin Michael Müller

The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…

Computation and Language · Computer Science 2014-12-11 Ramon Ferrer-i-Cancho

Let g be an integer greater than 1. A uniform version of the Parshin-Arakelov theorem on the finiteness of the set of non-isotrivial curves of genus g over a function field, with fixed degeneracy locus, is proved. This is applied to obtain…

Algebraic Geometry · Mathematics 2007-05-23 Lucia Caporaso

We study the ergodic theory of non-conservative C^1-generic diffeomorphisms. First, we show that homoclinic classes of arbitrary diffeomorphisms exhibit ergodic measures whose supports coincide with the homoclinic class. Second, we show…

Dynamical Systems · Mathematics 2008-09-22 Flavio Abdenur , Christian Bonatti , Sylvain Crovisier

Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one…

Computational Complexity · Computer Science 2016-03-02 Vít Jelínek , Eva Jelínková , Jan Kratochvíl

In this note we prove that any closed graph manifold admitting a metric of non-positive sectional curvature (NPC-metric) has a finite cover, which is fibered over the circle. An explicit criterion to have a finite cover, which is fibered…

Geometric Topology · Mathematics 2016-09-07 P. Svetlov

This paper is devoted to one-dimensional interpolation Gagliardo-Nirenberg-Sobolev inequalities. We study how various notions of duality, transport and monotonicity of functionals along flows defined by some nonlinear diffusion equations…

Analysis of PDEs · Mathematics 2017-05-17 Jean Dolbeault , Maria J. Esteban , Ari Laptev , Michael Loss

We study the expressivity of deep neural networks. Measuring a network's complexity by its number of connections or by its number of neurons, we consider the class of functions for which the error of best approximation with networks of a…

Functional Analysis · Mathematics 2020-07-20 Rémi Gribonval , Gitta Kutyniok , Morten Nielsen , Felix Voigtlaender

The (chordal) Loewner differential equation encodes certain curves in the half-plane (aka traces) by continuous real-valued driving functions. Not all curves are traces; the latter can be defined via a geometric condition called the local…

Complex Variables · Mathematics 2022-07-05 Yizheng Yuan

On one side, from the properties of Floer cohomology, invariant associated to a symplectic manifold, we define and study a notion of symplectic hyperbolicity and a symplectic capacity measuring it. On the other side, the usual notions of…

Symplectic Geometry · Mathematics 2007-05-23 Anne-Laure Biolley

The syntactic structure of sentences exhibits a striking regularity: dependencies tend to not cross when drawn above the sentence. We investigate two competing explanations. The traditional hypothesis is that this trend arises from an…

Computation and Language · Computer Science 2017-12-14 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez