相关论文: Self-Repelling Elastic Manifolds with Low Dimensio…
In this paper, we present a mathematical study of wave scattering by a hard elastic obstacle embedded in a soft elastic body in three dimensions. Our contributions are threefold. First, we characterize subwavelength resonances using the…
Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency…
I present numerical study of an elastic scattering by solving second order differential equations of Schroedinger Equation for some types of central potential (eg. square well, Yukawa, and Woods-Saxon) to find the wave function inside the…
A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…
We present a quantitative geometric rigidity estimate in dimensions $d=2,3$ generalizing the celebrated result by Friesecke, James, and M\"uller to the setting of variable domains. Loosely speaking, we show that for each $y \in…
In this paper, we focus on the sub-wavelength resonances in two-dimensional elastic media characterized by high contrasts in both Lam\'e parameters and density. Our contributions are fourfold. First, it is proved that the operator…
We study weighted residual dynamics associated with a rank-one projection in finite dimension. The iteration reduces, after finitely many steps, to a nonlinear recursion on a stabilized active subspace. We prove that this recursion can be…
In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…
In 1992, Kalai and Kleitman proved that the diameter of a $d$-dimensional polyhedron with $n$ facets is at most $n^{2+\log_2 d}$. In 2014, Todd improved the Kalai-Kleitman bound to $(n-d)^{\log_2 d}$. We improve the Todd bound to…
By methods of stochastic analysis on Riemannian manifolds, we derive explicit constants $c\_1(D)$ and $c\_2(D)$ for a $d$-dimensional compact Riemannian manifold $D$ with boundary such that $c\_1(D)\sqrt{\lambda}\|\phi\|\_\infty \le…
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…
Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…
Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…
Power cables have complex geometries in order to reduce their AC resistance. The cross-section of a cable consists of several conductors that are electrically insulated from each other to counteract the current displacement caused by the…
We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…
Recall that the radius of a compact metric space $(X, dist)$ is given by $rad\ X = \min_{x\in X} \max_{y\in X} dist(x,y)$. In this paper we generalize Berger's $\frac{1}{4}$-pinched rigidity theorem and show that a closed, simply connected,…
We discuss the asymptotic lower bound on the inner radius of nodal domains that arise from Laplacian eigenfunctions $ \phi_\lambda $ on a closed Riemannian manifold $ (M,g) $. First, in the real-analytic case we present an improvement of…
We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $\mathbb{Z}^d$, $d\geq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk…
Interest in the elastic properties of regular lattices constructed from domain walls has recently been motivated by cosmological applications as solid dark energy. This work investigates the particularly simple examples of triangular,…
The dynamics of a domain wall in magnetostrictive materials is investigated. The domain wall is modeled by a d-dimensional interface moving in a d+1-dimensional environment. Long-range demagnetization effects and quenched disorder are…