English
Related papers

Related papers: The impatient collector

200 papers

Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall…

Combinatorics · Mathematics 2007-05-23 Howard Kleiman

This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…

Computational Complexity · Computer Science 2010-09-24 Koji Kobayashi

For parameters $n,\delta,B,C$, we obtained a sharp asymptotic formula for the number of $(n+\lfloor n^\delta\rfloor)^2$-dimensional binary contingency tables with non-uniform margins taking values of $\lfloor BCn\rfloor$ and $\lfloor…

Combinatorics · Mathematics 2023-08-01 Da Wu

The omega limit sets plays a fundamental role to construct global attractors for topological semi-dynamical systems with continuous time or discrete time. Therefore, it is important to know when omega limit sets become nonempty compact…

General Topology · Mathematics 2021-09-24 Junya Nishiguchi

We show that it is possible to approximate the zeta-function of a curve over a finite field by meromorphic functions which satisfy the same functional equation and moreover satisfy (respectively do not satisfy) the analogue of the Riemann…

Complex Variables · Mathematics 2010-08-04 P. M. Gauthier , N. Tarkhanov

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

Number Theory · Mathematics 2023-03-02 Jing Ma , Ronghui Wu

In contrast to entropy, which increases monotonically, the "complexity" or "interestingness" of closed systems seems intuitively to increase at first and then decrease as equilibrium is approached. For example, our universe lacked complex…

Statistical Mechanics · Physics 2014-05-28 Scott Aaronson , Sean M. Carroll , Lauren Ouellette

In this work we establish under certain hypotheses the $N \to +\infty$ asymptotic expansion of integrals of the form $$\mathcal{Z}_{N,\Gamma}[V] \, = \, \int_{\Gamma^N} \prod_{ a < b}^{N}(z_a - z_b)^\beta \, \prod_{k=1}^{N} \mathrm{e}^{ - N…

Mathematical Physics · Physics 2024-11-22 Alice Guionnet , Karol Kozlowski , Alex Little

The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the algorithm independently and uniformly at…

Combinatorics · Mathematics 2024-12-24 Alan Frieze , Pu Gao , Calum MacRury , Paweł Prałat , Gregory Sorkin

We consider an optimal control problem with tracking-type cost functional constrained by the Cattaneo equation, which is a well-known model for delayed heat transfer. In particular, we are interested the asymptotic behaviour of the optimal…

Optimization and Control · Mathematics 2025-10-14 Sebastian Blauth , René Pinnau , Matthias Andres , Claudia Totzeck

This paper studies a version of the counting problem in dynamical systems that is of interest, especially in conformal dynamical systems where the functions of the systems are angle preserving. Recently, M. Pollicott and M. Urba\'{n}ski…

Dynamical Systems · Mathematics 2024-09-17 Hamid Naderiyan

Let $\cC$ be a smooth absolutely irreducible curve of genus $g \ge 1$ defined over $\F_q$, the finite field of $q$ elements. Let $# \cC(\F_{q^n})$ be the number of $\F_{q^n}$-rational points on $\cC$. Under a certain multiplicative…

Number Theory · Mathematics 2010-03-15 Omran Ahmadi , Igor E. Shparlinski

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice $\Lambda \subseteq \mathbb{R}^d$ inside the $d$-sphere of radius $R$. In contrast to…

Number Theory · Mathematics 2025-07-28 David Lowry-Duda , Takashi Taniguchi , Frank Thorne

A cycle expansion for the Lyapunov exponent of a product of random matrices is derived. The formula is non-perturbative and numerically effective, which allows the Lyapunov exponent to be computed to high accuracy. In particular, the free…

chao-dyn · Physics 2008-02-03 Ronnie Mainieri

In this paper, an asymptotic stability proof for a class of methods for inexact nonlinear model predictive control is presented. General Q-linearly convergent online optimization methods are considered and an asymptotic stability result is…

Optimization and Control · Mathematics 2021-12-01 Andrea Zanelli , Quoc Tran Dinh , Moritz Diehl

We describe a way to complete a correlation matrix that is not fully specified. Such matrices often arise in financial applications when the number of stochastic variables becomes large or when several smaller models are combined in a…

Mathematical Finance · Quantitative Finance 2021-11-25 Olaf Dreyer , Horst Köhler , Thomas Streuer

We introduce a new approach to the the asymptotic iteration method (AIM) by means of which we establish the standard AIM connection with the continued fractions technique and we develop a novel termination condition in terms of the…

Classical Analysis and ODEs · Mathematics 2023-03-07 Davide Batic , Marek Nowakowski

We develop an asymptotical control theory for one of the simplest distributed (infinite dimensional) oscillating systems, namely, for a closed string under a bounded load applied to a single distinguished point. We find exact classes of…

Optimization and Control · Mathematics 2022-02-21 Lev Lokutsievskiy , Alexander Ovseevich

A collection of finite sets $\{A_1, A_2,\ldots, A_{p}\}$ is said to be a double-covering if each $a\in \cup_{k=1}^{p}A_k$ is included in exactly two sets of the collection. For fixed integers $l$ and $p$, let $\mu_{l,p}$ be the number of…

Classical Analysis and ODEs · Mathematics 2025-12-09 Grigori A. Karagulyan , Vahe G. Karagulyan