English
Related papers

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

200 papers

Uninorms with continuous underlying t-norm and t-conorm are discussed and properties of the set of discontinuity points of such a uninorm are shown. This set is proved to be a subset of the graph of a special symmetric, surjective,…

Classical Analysis and ODEs · Mathematics 2016-07-19 Andrea Mesiarova-Zemankova

A new class of rational parametrization has been developed and it was used to generate a new family of rational functions B-splines $\displaystyle{{\left({}^{\alpha}{\mathbf B}_{i}^{k} \right)}_{i=0}^{k}}$ which depends on an index $\alpha…

Computational Geometry · Computer Science 2018-05-14 Mohamed Allaoui , Aurélien Goudjo

We establish the following result: if the graph of a (nonsmooth) real-extended-valued function $f:\mathbb{R}^{n}\to \mathbb{R}\cup\{+\infty\}$ is closed and admits a Whitney stratification, then the norm of the gradient of $f$ at…

Optimization and Control · Mathematics 2007-05-23 J. Bolte , A. Daniilidis , A. S. Lewis , M. Shiota

Discontinuous piecewise differential systems exhibit dynamical behaviors with no counterpart in smooth systems, particularly in the presence of nonsmooth switching structures. In this work, we extend previous results for systems separated…

Dynamical Systems · Mathematics 2026-04-22 Sonia Isabel Renteria Alva , Pedro Iván Suárez Navarro

Despite the vast success of standard planar convolutional neural networks, they are not the most efficient choice for analyzing signals that lie on an arbitrarily curved manifold, such as a cylinder. The problem arises when one performs a…

Computer Vision and Pattern Recognition · Computer Science 2021-07-28 Bahar Azari , Deniz Erdogmus

Contrastive learning is an efficient approach to self-supervised representation learning. Although recent studies have made progress in the theoretical understanding of contrastive learning, the investigation of how to characterize the…

Machine Learning · Computer Science 2023-08-21 Hiroki Waida , Yuichiro Wada , Léo Andéol , Takumi Nakagawa , Yuhui Zhang , Takafumi Kanamori

For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…

Combinatorics · Mathematics 2020-05-19 John C. Urschel , Jake Wellens

In this article, we study the properties of a class of functional spaces which arise from the investigation of nonlinear differential equations. We establish some integral inequalities then by applying these inequalities, we prove some…

Functional Analysis · Mathematics 2023-10-11 Kamal N. Soltanov , Ugur Sert

We define boundedness properties on the contractible fixed points set of the time-one map of an identity isotopy on a closed oriented surface with genus $g\geq1$. In symplectic geometry, a classical object is the notion of action function,…

Dynamical Systems · Mathematics 2012-09-11 Jian Wang

The integrability (solvability via an associated single-valued linear problem) of a differential equation is closely related to the singularity structure of its solutions. In particular, there is strong evidence that all integrable…

solv-int · Physics 2009-10-30 Martin D. Kruskal , Nalini Joshi , Rod Halburd

We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a…

Physics and Society · Physics 2009-11-13 Kazuhiro Takemoto , Chikoo Oosawa , Tatsuya Akutsu

In this article we deduce necessary and sufficient conditions for the presence of `Conti-type', highly symmetric, exactly-stress free constructions in the geometrically non-linear, planar $n$-well problem, generalising results of [CKZ17].…

A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be…

Discrete Mathematics · Computer Science 2017-11-06 Christian Bachmaier , Franz J. Brandenburg , Kathrin Hanauer , Daniel Neuwirth , Josef Reislhuber

The Liouville theorem states that bounded holomorphic complex functions are necessarily constant. Holomorphic functions fulfill the socalled Cauchy-Riemann (CR) conditions. The CR conditions mean that a complex $z$-derivative is independent…

Neural and Evolutionary Computing · Computer Science 2013-06-10 Eckhard Hitzer

In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…

Functional Analysis · Mathematics 2021-11-01 Vladimir Temlyakov , Tino Ullrich

We focus on a sequence of functions $\{f_n\}$, defined on a compact manifold with boundary $S$, converging in the $C^k$ metric to a limit $f$. A common assumption implicitly made in the empirical sciences is that when such functions…

General Topology · Mathematics 2025-08-11 Thomas J. Maullin-Sapey , Samuel Davenport

The conformal algebra in 2D (Diff($S^{1}$)$\oplus$Diff($S^{1}$)) is shown to be preserved under a nonlinear map that mixes both chiral (holomorphic) generators $T$ and $\bar{T}$. It depends on a single real parameter and it can be regarded…

High Energy Physics - Theory · Physics 2023-01-04 David Tempo , Ricardo Troncoso

First, we construct a class of functions with good local avalanche characteristics, but bad global avalanche characteristics. We also derive some bounds for the nonlinearity of such functions. It improves upon the results of Son et al., and…

Combinatorics · Mathematics 2007-05-23 Pantelimon Stanica

Neural collapse (NC) is a phenomenon that emerges at the terminal phase of the training (TPT) of deep neural networks (DNNs). The features of the data in the same class collapse to their respective sample means and the sample means exhibit…

Machine Learning · Statistics 2024-09-09 Wanli Hong , Shuyang Ling

In this note, we continue to highlight some applications of Theorem 1 of [3]. Here is a sample: Let $X$ be an open set in ${\bf C}^n$, $\Omega$ an open convex set in ${\bf C}$ and $f, g : X\to {\bf C}$ two holomorphic functions such that…

Functional Analysis · Mathematics 2014-02-19 Biagio Ricceri