Related papers: Sequential discontinuity and first-order problems
This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…
The degree of a based graph is the number of essential nonbasepoint vertices after generic perturbation. Hatcher--Vogtmann's degree theorem states that the subcomplex of Auter space of graphs of degree at most d is (d-1)-connected. We…
The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade. Despite its popularity, very little is known in terms…
Kechris and Martin showed that the Wadge rank of the $\omega$-th level of the decreasing difference hierarchy of coanalytic sets is $\omega_2$ under the axiom of determinacy. In this article, we give an alternative proof of the…
We present an exact first-order perturbation theory for the eigenmodes in systems with interfaces causing material discontinuities. We show that when interfaces deform, higher-order terms of the perturbation series can contribute to the…
We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…
We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…
We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than the unit ball approach (which has been the…
We introduce a parametrized version of the Wadge game for functions and show that each lower cone in the Weihrauch degrees is characterized by such a game. These parametrized Wadge games subsume the original Wadge game, the eraser and…
Let $\mathcal{A}$ be a mathematical structure with an additional relation $R$. We are interested in the degree spectrum of $R$, either among computable copies of $\mathcal{A}$ when $(\mathcal{A},R)$ is a "natural" structure, or (to make…
Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical…
In this paper, we introduce the new class of continua; weakly infinite-dimensional closed set-aposyndetic continua. With this notion, we show that there exists a non-D-continuum such that each positive Whitney level of the hyperspace of the…
We propose a study of structured non-convex non-concave min-max problems which goes beyond standard first-order approaches. Inspired by the tight understanding established in recent works [Adil et al., 2022, Lin and Jordan, 2022b], we…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…
This paper discusses several (sub)gradient methods attaining the optimal complexity for smooth problems with Lipschitz continuous gradients, nonsmooth problems with bounded variation of subgradients, weakly smooth problems with H\"older…
We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa's result that there are no minimal pairs for relative generic computability, and answers a…
In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many $k$-DDPC, one-to-many $k$-DDPC and one-to-one $k$-DDPC, which are intimately connected to other famous topics in graph theory,…
In this paper, we shall study the Dirichlet problem for the minimal surfaces equation. We prove some results about the boundary behaviour of a solution of this problem. We describe the behaviour of a non-converging sequence of solutions in…
In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…