Related papers: On Berry's conjectures about the stable order in P…
This study presents new estimates for fractional derivatives without singular kernels defined by some specific functions. Based on obtained inequalities, we give a useful method to establish the global stability of steady states for…
Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…
In this work, we report a stable ordered structure -- the cubic FDDD phase -- that has not previously been identified in the Landau-Brazovskii (LB) model, a fundamental and important model for studying crystals and their phase transitions.…
We investigate the structure and stability of the steady states for a bacterial colony model with density-suppressed motility. We treat the growth rate of bacteria as a bifurcation parameter to explore the local and global structure of the…
Bifurcation analysis collects techniques for characterizing the dependence of certain classes of solutions of a dynamical system on variations in problem parameters. Common solution classes of interest include equilibria and periodic…
We show that the theory of algebraically closed fields with multiplicative circular orders has a model companion $\mathrm{ACFO}$. Using number-theoretic results on character sums over finite fields, we show that if $\mathbb{F}$ is an…
The paper shows sufficiency conditions for stability of continuous periodic orbits under phase uncertainty. Phase based uncertainty is a trait of bipedal walking robots, where the desired trajectories are parameterized by a monotonous…
B. Blackadar recently proved that any full corner $pAp$ in a unital C*-algebra $A$ has K-theoretic stable rank greater than or equal to the stable rank of $A$. (Here $p$ is a projection in $A$, and fullness means that $ApA=A$.) This result…
We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…
This paper is devoted to studying the asymptotic behaviour of solutions to generalized non-commensurate fractional systems. To this end, we first consider fractional systems with rational orders and introduce a criterion that is necessary…
In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
In this paper, we discover a new noncommutative algebra. We refer this algebra as the constant term algebra of type $A$, which is generated by certain constant term operators. We characterize a structural result of this algebra by…
A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…
The present article considers stability of the solutions to nonlinear and nonautonomous compartmental systems governed by ordinary differential equations (ODEs). In particular, compartmental systems with a right-hand side that can be…
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the…
We give an alternative to the stable classification of p-completed homotopy types of classifying spaces of finite groups offered by Martino-Priddy. For a finite group G with Sylow subgroup S, we regard the stable p-completed classifying…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
Starting from an A-stable rational approximation to $\rm{e}^z$ of order $p$, $$r(z)= 1+ z+ \cdots + z^p/ p! + O(z^{p+1}),$$ families of stable methods are proposed to time discretize abstract IVP's of the type $u'(t) = A u(t) + f(t)$. These…
We prove that the stable category associated with the category $\mathsf{PreOrd}(\mathbb C)$ of internal preorders in a pretopos $\mathbb C$ satisfies a universal property. The canonical functor from $\mathsf{PreOrd}(\mathbb C)$ to the…