English
Related papers

Related papers: Topological reducibilities for discontinuous funct…

200 papers

We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthemore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this…

Optimization and Control · Mathematics 2024-10-07 Felipe Lara , Raúl T. Marcavillaca , Phan T. Vuong

This paper is focused on geometric aspects of two particular types of finite-variable reductions in the dispersionless Toda hierarchy. The reductions are formulated in terms of "Landau-Ginzburg potentials" that play the role of reduced Lax…

Mathematical Physics · Physics 2012-12-20 Kanehisa Takasaki

The notion of constructible functions in the setting of tame real geometry has been introduced by Cluckers and Dan Miller in their work on parametric integration of globally subanalytic functions. A function on a globally subanalytic set is…

Logic · Mathematics 2026-04-28 Tobias Kaiser

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

We develop the theory of Thurston maps that are defined everywhere on the topological sphere $S^2$ with a possible exception of a single essential singularity. We establish an analog of the celebrated W. Thurston's characterization theorem…

Dynamical Systems · Mathematics 2024-10-03 Nikolai Prochorov

A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…

Optimization and Control · Mathematics 2012-07-24 Andreas H. Hamel , Carola Schrage

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

We answer a question by Vasco Brattka and Guido Gherardi by proving that the Weihrauch-lattice is not a Brouwer algebra. The computable Weihrauch-lattice is also not a Heyting algebra, but the continuous Weihrauch-lattice is. We further…

Logic in Computer Science · Computer Science 2015-07-01 Kojiro Higuchi , Arno Pauly

The Toda lattice hierarchy is discussed in connection with the topological description of the $c=1$ string theory compactified at the self-dual radius. It is shown that when special constraints are imposed on the Toda hierarchy, it…

High Energy Physics - Theory · Physics 2009-10-28 T. Eguchi , H. Kanno

We present a unified deductive verification framework for first-order temporal properties based on well-founded rankings, where verification conditions are discharged using SMT solvers. To that end, we introduce a novel reduction from…

Logic in Computer Science · Computer Science 2026-01-21 Raz Lotan , Neta Elad , Oded Padon , Sharon Shoham

We develop a correspondence between the structure of Turing machines and the structure of singularities of real analytic functions, based on connecting the Ehrhard-Regnier derivative from linear logic with the role of geometry in Watanabe's…

Logic in Computer Science · Computer Science 2025-04-14 Daniel Murfet , Will Troiani

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…

Computational Complexity · Computer Science 2010-06-03 Matthew S. Bauer , Xizhong Zheng

Real-world phenomena do not generate arbitrary variability: their signals concentrate on compact, low-variability subsets of functional space, enabling rapid generalisation from few examples. We formalise this principle through a…

Machine Learning · Computer Science 2026-04-29 Eduardo Di Santi

We define a model for rank one measure preserving transformations in the sense of [2]. This is done by defining a new Polish topology on the space of codes, which are infinite rank one words, for symbolic rank one systems. We establish that…

Dynamical Systems · Mathematics 2013-08-14 Su Gao , Aaron Hill

We define a new rearrangement, called rearrangement by tamping, for non-negative measurable functions defined on R+. This rearrangement has many properties in common with the well-known Schwarz non-increasing rearrangement such as the…

Analysis of PDEs · Mathematics 2019-11-28 Ludovic Godard-Cadillac

For a set $X\sbst\R$, let $B(X)\sbst\R^X$ denote the space of Borel real-valued functions on $X$, with the topology inherited from the Tychonoff product $\R^X$. Assume that for each countable $A\sbst B(X)$, each $f$ in the closure of $A$ is…

General Topology · Mathematics 2012-10-19 Tal Orenshtein , Boaz Tsaban

Morrey Conjecture deals with two properties of functions which are known as quasi-convexity and rank-one convexity. It is well established that every function satisfying the quasi-convexity property also satisfies rank-one convexity. Morrey…

Functional Analysis · Mathematics 2022-11-22 Xinghao Dong , Koffi Enakoutsa

In this paper, we study arithmetic dynamics in arbitrary characteristic, in particular in positive characteristic. We generalise some basic facts on arithmetic degree and canonical height in positive characteristic. As applications, we…

Dynamical Systems · Mathematics 2021-07-09 Junyi Xie

A Polish group $G$ has the generic point property if any minimal $G$-flow admits a comeager orbit, or equivalently if the universal minimal flow (UMF) does. The class $\mathsf{GPP}$ of such Polish groups is a proper extension of the class…

Dynamical Systems · Mathematics 2025-09-11 Gianluca Basso , Andy Zucker

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

Logic in Computer Science · Computer Science 2017-08-17 Abhinav Aggarwal , Padam Kumar