相关论文: On Periodic Decompositions and Nonexpansive Lines
We study an interplay between delay and discontinuous hysteresis in dynamical systems. After having established existence and uniqueness of solutions, we focus on the analysis of stability of periodic solutions. The main object we study is…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
We consider the elliptic-elliptic, focussing Davey-Stewartson equations, which have an explicit bright line soliton solution. The existence of a family of periodic solitons, which have the profile of the line soliton in the longitudinal…
We address a two-dimensional nonlinear elliptic problem with a finite-amplitude periodic potential. For a class of separable symmetric potentials, we study the bifurcation of the first band gap in the spectrum of the linear Schr\"{o}dinger…
Least squares deconvolution (LSD) is a powerful method of extracting high-precision average line profiles from the stellar intensity and polarization spectra. Despite its common usage, the LSD method is poorly documented and has never been…
We develop a contraction-based framework to establish the existence and exponential stability of periodic solutions in planar nonsmooth dynamical systems governed by Filippov differential inclusions. The method integrates a time- and…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
Nonlinear effects on the early stage of phase ordering are studied using Adomian's decomposition method for the Ginzburg-Landau equation for a nonconserved order parameter. While the long-time regime and the linear behavior at short times…
A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…
Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…
Recently, Meta-Auto-Decoder (MAD) was proposed as a novel reduced order model (ROM) for solving parametric partial differential equations (PDEs), and the best possible performance of this method can be quantified by the decoder width. This…
Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…
For the additive white Gaussian noise channel with average codeword power constraint, new coding methods are devised in which the codewords are sparse superpositions, that is, linear combinations of subsets of vectors from a given design,…
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…
An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$…
In this paper, we define the recurrence and "non-wandering" for decompositions. The following inclusion relations hold for codimension one foliations on closed $3$-manifolds: $\{$minimal$\} \sqcup \{$compact$\}$ $\subsetneq$ $\{$pointwise…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the…
We construct heterotic string theories on spacetimes of the form R^{d-1,1} times N=2 linear dilaton, where d=6,4,2,0. There are two lines of supersymmetric theories descending from the two supersymmetric ten-dimensional heterotic theories.…
A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most…