English
Related papers

Related papers: Translation invariant realizability problem on the…

200 papers

Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…

Data Structures and Algorithms · Computer Science 2021-10-26 Édouard Bonnet , Eun Jung Kim , Stéphan Thomassé , Rémi Watrigant

For translationally invariant one-band lattice models, we exploit the ab initio knowledge of the natural orbitals to simplify reduced density matrix functional theory (RDMFT). Striking underlying features are discovered: First, within each…

Quantum Physics · Physics 2019-01-08 Christian Schilling , Rolf Schilling

A fascinating inverse problem that has been receiving considerable attention is the construction of realizations of random two-phase heterogeneous media with a target two-point correlation function. However, not every hypothetical two-point…

Disordered Systems and Neural Networks · Physics 2007-05-23 Salvatore Torquato

Realization of $d$-dimensional effective subshifts as projective sub-actions of $d+d'$-dimensional sofic subshifts for $d'\geq 1$ is now well know~\cite{Hochman-2009,Durand-Romashchenko-Shen-2010,Aubrun-Sablik-2010}. In this paper we are…

Dynamical Systems · Mathematics 2013-08-09 Anne Crumière , Mathieu Sablik , Michael Schraudner

We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…

Numerical Analysis · Mathematics 2014-12-03 Erich Novak , Daniel Rudolf

We study the problem of bounding path-dependent expectations (within any finite time horizon $d$) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark…

Probability · Mathematics 2021-12-01 Zhengqing Zhou , Jose Blanchet , Peter W. Glynn

Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state or action effects. The problem has been approached as a path-finding problem in belief space where…

Artificial Intelligence · Computer Science 2014-01-16 Hector Palacios , Hector Geffner

We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. We consider two kind of…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Alexander A. Rubtsov

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

Numerical Analysis · Mathematics 2022-09-05 Frances Y. Kuo , Weiwen Mo , Dirk Nuyens

I construct a two-dimensional lattice on which the inhomogeneous site percolation threshold is exactly calculable and use this result to find two more lattices on which the site thresholds can be determined. The primary lattice studied…

Disordered Systems and Neural Networks · Physics 2013-05-29 Chris Scullard

Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…

Probability · Mathematics 2025-06-23 Dor Elboim , Yinon Spinka , Oren Yakir

Simultaneous tiling for several different translational sets has been studied rather extensively, particularly in connection with the Steinhaus problem. The study of orthonormal wavelets in recent years, particularly for arbitrary dilation…

General Mathematics · Mathematics 2007-05-23 Eugen J. Ionascu , Yang Wang

We seek to provide practicable approximations of the two-stage robust stochastic optimization (RSO) model when its ambiguity set is constructed with an f-divergence radius. These models are known to be numerically challenging to various…

Optimization and Control · Mathematics 2023-08-15 Aakil M. Caunhye , Douglas Alem

For systems of one-component interacting oscillators on the d-dimensional lattice, d>1, whose potential energy besides a large nearest-neighbour (n-n) ferromagnetic translation-invariant quadratic term contains small non-nearest-neighbour…

Statistical Mechanics · Physics 2016-08-31 W. I. Skrypnik

This paper investigates a specific class of nonsmooth nonconvex optimization problems in the face of data uncertainty, namely, robust optimization problems, where the given objective function can be expressed as a difference of two…

Optimization and Control · Mathematics 2026-02-20 Feryal Mashkoorzadeh , Nooshin Movahedian

Some examples of translation invariant site percolation processes on the $\Z^2$ lattice are constructed, the most far-reaching example being one that satisfies uniform finite energy (meaning that the probability that a site is open given…

Probability · Mathematics 2010-11-15 Olle Hägström , Péter Mester

It is shown that the partition function of the 2d Ising model on the dual finite lattice with periodical boundary conditions is expressed through some specific combination of the partition functions of the model on the torus with…

High Energy Physics - Theory · Physics 2009-10-30 Anatolij I. Bugrij , Vitalij N. Shadura

Stability of the value function and the set of minimizers w.r.t. the given data is a desirable feature of optimal transport problems. For the classical Kantorovich transport problem, stability is satisfied under mild assumptions and in…

Optimization and Control · Mathematics 2021-01-19 Martin Brückerhoff , Nicolas Juillet

We prove $L^{2}$ estimates and solvability for a variety of simply characteristic constant coefficient partial differential equations $P(D)u=f$. These estimates \[||u||_{L^2(D_{r})}\le C\sqrt{d_{r}d_{s}} ||f||_{_{L^2(D_{s})}}\] depend on…

Analysis of PDEs · Mathematics 2017-10-04 Eemeli Blåsten , John Sylvester

Let $Z \subseteq \proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal…

Commutative Algebra · Mathematics 2012-04-02 Stefan O. Tohaneanu , Adam Van Tuyl