English
Related papers

Related papers: A solution to Roitman's problem

200 papers

This paper generalizes the results of [13] and then provides an interesting example. We construct a family of $W$-like maps $\{W_a\}$ with a turning fixed point having slope $s_1$ on one side and $-s_2$ on the other. Each $W_a$ has an…

Dynamical Systems · Mathematics 2013-10-18 Zhenyang Li

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

The paper aims at the development of tools for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems with long run average optimality criteria. The idea that we exploit is to first…

Optimization and Control · Mathematics 2014-08-20 Vladimir Gaitsgory , Ludmila Manic , Sergey Rossomakhine

In this work we establish some rigidity results for Serrin's overdetermined problem \begin{equation*} \left\{ \begin{array}{cll} - \Delta u=f(u) & \text{in}& \Omega,\newline u > 0& \text{in} & \Omega,\newline u=0 & \text{on} & \partial…

Analysis of PDEs · Mathematics 2025-02-10 Nicolas Beuvin , Alberto Farina

We study the asymptotic behavior of solutions of an equation of the form \begin{equation}\label{abs}\tag{*} G\big(x, D_x u,\lambda u(x)\big) = c_0\qquad\hbox{in $M$} \end{equation} on a closed Riemannian manifold $M$, where $G\in…

Analysis of PDEs · Mathematics 2024-11-22 Andrea Davini , Panrui Ni , Jun Yan , Maxime Zavidovique

We investigate the structure of the nodal set of solutions to an unstable Alt-Phillips type problem \[ -\Delta u = \lambda_+(u^+)^{p-1}-\lambda_-(u^-)^{q-1} \] where $1 \le p<q<2$, $\lambda_+ >0$, $\lambda_- \ge 0$. The equation is…

Analysis of PDEs · Mathematics 2024-03-26 Nicola Soave , Giorgio Tortone

Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…

Algebraic Geometry · Mathematics 2018-07-13 Tuyen Trung Truong

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

An entire solution of the Allen-Cahn equation $\Delta u=f(u)$, where $f$ has exactly three zeros at $\pm 1$ and 0, is balanced and odd, e.g. $f(u)=u(u^2-1)$, is called a $2k$-ended solution if its nodal set is asymptotic to $2k$ half lines,…

Analysis of PDEs · Mathematics 2011-09-30 Frank Pacard , Michal Kowalczyk , Yong Liu

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Information Theory · Computer Science 2026-01-01 Augustin Cosse

In this paper we prove a H\"older partial regularity result for weak solutions $u:\Omega\to \mathbb{R}^N$, $N\geq 2$, to non-autonomous elliptic systems with general growth of the type: \begin{equation*} -\rm{div}\, a(x, u, Du)= b(x, u, Du)…

Analysis of PDEs · Mathematics 2021-09-01 Teresa Isernia , Chiara Leone , Anna Verde

We find new bounds on the conformal dimension of small cancellation groups. These are used to show that a random few relator group has conformal dimension 2+o(1) asymptotically almost surely (a.a.s.). In fact, if the number of relators…

Group Theory · Mathematics 2018-12-13 John M. Mackay

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Logic · Mathematics 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

Let $u_{g}$ the unique solution of a parabolic variational inequality of second kind, with a given $g$. Using a regularization method, we prove, for all $g_{1}$ and $g_{2}$, a monotony property between $\mu u_{g_{1}} + (1-\mu)u_{g_{2}}$ and…

Analysis of PDEs · Mathematics 2013-09-20 Mahdi Boukrouche , Domingo A. Tarzia

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…

Group Theory · Mathematics 2015-09-16 Alexander Bors

We establish partial regularity result for vector-valued solutions to second order elliptic system in divergence form. The coefficients safisfies Dini condition respect to $(x,u)$ with growth order lager than 2. We prove $C^1$-regularity of…

Analysis of PDEs · Mathematics 2013-07-09 Taku Kanazawa

We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…

Numerical Analysis · Mathematics 2021-07-14 Gregor Gantner , Alexander Haberl , Dirk Praetorius , Stefan Schimanko

We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…

Logic in Computer Science · Computer Science 2023-06-19 Bartosz Bednarczyk , Daumantas Kojelis , Ian Pratt-Hartmann