English
Related papers

Related papers: On partial rigidity of $\mathcal{S}$-adic subshift…

200 papers

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Combinatorics · Mathematics 2011-08-30 Suyoung Choi , Jang Soo Kim

Topologically ordered states are quantum states of matter with topological ground state degeneracy and quasi-particles carrying fractional quantum numbers and fractional statistics. The topological spin $\theta_a=2\pi h_a$ is an important…

Strongly Correlated Electrons · Physics 2014-09-02 Hong-Hao Tu , Yi Zhang , Xiao-Liang Qi

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

Metric Geometry · Mathematics 2015-03-17 Justin Malestein , Louis Theran

We identify the restricted class of attainable effective deformations in a model of reinforced composites with parallel, long, and fully rigid fibers embedded in an elastic body. In mathematical terms, we characterize the weak limits of…

Analysis of PDEs · Mathematics 2021-05-11 Dominik Engl , Carolin Kreisbeck , Antonella Ritorto

We consider the numerical approximation of the mild solution to a semilinear stochastic wave equation driven by additive noise. For the spatial approximation we consider a standard finite element method and for the temporal approximation, a…

Numerical Analysis · Mathematics 2023-12-06 Mihály Kovács , Annika Lang , Andreas Petersson

Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…

Optimization and Control · Mathematics 2022-05-24 Temitayo Ajayi , Taewoo Lee , Andrew Schaefer

We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important…

Data Structures and Algorithms · Computer Science 2018-11-20 Alina Ene , Huy L. Nguyen

We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…

Dynamical Systems · Mathematics 2021-07-01 Andrew Dykstra , Nicholas Ormes , Ronnie Pavlov

The stability and the basin of attraction of a periodic orbit can be determined using a contraction metric, i.e., a Riemannian metric with respect to which adjacent solutions contract. A contraction metric does not require knowledge of the…

Dynamical Systems · Mathematics 2018-08-09 Peter Giesl

In this article, the existence and uniqueness about the solution for a class of stochastic fractional-order differential equation systems are investigated, where the fractional derivative is described in Caputo sense. The fractional…

Numerical Analysis · Mathematics 2016-11-24 Guang-an Zou , Bo Wang

Suppose $G$ is a higher-rank connected semisimple Lie group with finite center and without compact factors. Let $\mathbb{G}=G$ or $\mathbb{G}=G\ltimes V$, where $V$ is a finite dimensional vector space $V$. For any unitary representation…

Dynamical Systems · Mathematics 2017-03-20 Zheni Jenny Wang

We study a notion of local time for a continuous path, defined as a limit of suitable discrete quantities along a general sequence of partitions of the time interval. Our approach subsumes other existing definitions and agrees with the…

Probability · Mathematics 2017-01-26 Mark Davis , Jan Obłój , Pietro Siorpaes

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Combinatorics · Mathematics 2012-10-24 Justin Malestein , Louis Theran

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

Probability · Mathematics 2016-07-06 Richard Arratia , Stephen DeSalvo

The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Starting from the recently proposed proximal variant of the extragradient method for this class…

Optimization and Control · Mathematics 2023-08-02 S. S. Ablaev , F. S. Stonyakin , M. S. Alkousa , D. A. Pasechnyuk

This paper aims to provide various applications for second-order variational analysis of extended-real-valued piecewise liner functions recently obtained in [1]. We mainly focus here on establishing relationships between full stability of…

Optimization and Control · Mathematics 2016-08-23 B. S. Mordukhovich , M. E. Sarabi

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

Machine Learning · Computer Science 2024-01-24 Alexandre d'Aspremont , Cristóbal Guzmán , Clément Lezane

The method of iterated conformal maps is developed for quasi-static fracture of brittle materials, for all modes of fracture. Previous theory, that was relevant for mode III only, is extended here to mode I and II. The latter require…

Statistical Mechanics · Physics 2009-11-07 Felipe Barra , Anders Levermann , Itamar Procaccia

The paper is concerned with the change of probability measures $\mu$ along non-random probability measure valued trajectories $\nu_t$, $t\in [-1,1]$. Typically solutions to non-linear PDEs, modeling spatial development as time progresses,…

Analysis of PDEs · Mathematics 2024-10-08 Jörg-Uwe Löbus

In the stochastic submodular cover problem, the goal is to select a subset of stochastic items of minimum expected cost to cover a submodular function. Solutions in this setting correspond to sequential decision processes that select items…

Data Structures and Algorithms · Computer Science 2021-07-01 Rohan Ghuge , Anupam Gupta , Viswanath Nagarajan