English
Related papers

Related papers: The impatient collector

200 papers

An effective solution to the problem of Hermite $G^1$ interpolation with a clothoid curve is provided. At the beginning the problem is naturally formulated as a system of nonlinear equations with multiple solutions that is generally…

Numerical Analysis · Mathematics 2016-07-18 Enrico Bertolazzi , Marco Frego

In a growth-fragmentation system, cells grow in size slowly and split apart at random. Typically, the number of cells in the system grows exponentially and the distribution of the sizes of cells settles into an equilibrium 'asymptotic…

Probability · Mathematics 2025-01-22 Denis Villemonais , Alexander Watson

We introduce "puzzles of quasi-finite type" which are the counterparts of our subshifts of quasi-finite type (Invent. Math. 159 (2005)) in the setting of combinatorial puzzles as defined in complex dynamics. We are able to analyze these…

Dynamical Systems · Mathematics 2009-09-14 Jerome Buzzi

We introduce a novel quantity for general dynamical systems, which we call the asymptotic uniform complexity. We prove an inequality relating the asymptotic uniform complexity of a dynamical system to its mean topological matching number.…

Group Theory · Mathematics 2015-02-19 Friedrich Martin Schneider

In this work we construct an automaton for the commutative closure of a given regular group language. The number of states of the resulting automaton is bounded by the number of states of the original automaton, raised to the power of the…

Formal Languages and Automata Theory · Computer Science 2020-08-14 Stefan Hoffmann

We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…

Number Theory · Mathematics 2007-05-23 Hendrik Hubrechts

We study fundamental theoretical aspects of probabilistic roadmaps (PRM) in the finite time (non-asymptotic) regime. In particular, we investigate how completeness and optimality guarantees of the approach are influenced by the underlying…

Data Structures and Algorithms · Computer Science 2019-09-24 Matthew Tsao , Kiril Solovey , Marco Pavone

In this paper, we study the portfolio optimization problem with general utility functions and when the return and volatility of underlying asset are slowly varying. An asymptotic optimal strategy is provided within a specific class of…

Mathematical Finance · Quantitative Finance 2016-11-08 Jean-Pierre Fouque , Ruimeng Hu

We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same…

Logic in Computer Science · Computer Science 2018-02-13 Paulin Fournier , Hugo Gimbert

For the Riesz and logarithmic potentials, we consider greedy energy sequences $(a_n)_{n=0}^\infty$ on the unit circle $S^1$, constructed in such a way that for every $n\geq 1$, the discrete potential generated by the first $n$ points…

Classical Analysis and ODEs · Mathematics 2024-07-16 Abey López-García , Erwin Miña-Díaz

Our goal is to find an asymptotic behavior as $n\to\infty$ of orthogonal polynomials $P_{n}(z)$ defined by the Jacobi recurrence coefficients $a_{n}, b_{n}$. We suppose that the off-diagonal coefficients $a_{n}$ grow so rapidly that the…

Classical Analysis and ODEs · Mathematics 2019-12-19 Dmitri Yafaev

We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…

Statistics Theory · Mathematics 2007-12-18 Jiming Jiang , Yihui Luan , You-Gan Wang

We study the unit-demand capacitated vehicle routing problem in the random setting of the Euclidean plane. The objective is to visit $n$ random terminals in a square using a set of tours of minimum total length, such that each tour visits…

Data Structures and Algorithms · Computer Science 2023-04-25 Zipei Nie , Hang Zhou

A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find…

Combinatorics · Mathematics 2016-05-10 Kaushik Sarkar , Charles J. Colbourn , Annalisa De Bonis , Ugo Vaccaro

We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…

Probability · Mathematics 2022-04-15 Lorenzo Federico , Remco van der Hofstad

In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of $\kappa$, of the edges in the tour. This problem is known to be NP-hard.…

Optimization and Control · Mathematics 2012-09-25 Syed Talha Jawaid , Stephen L. Smith

We show that there is a language in $\mathsf{S}_2\mathsf{E}/_1$ (symmetric exponential time with one bit of advice) with circuit complexity at least $2^n/n$. In particular, the above also implies the same near-maximum circuit lower bounds…

Computational Complexity · Computer Science 2023-09-25 Lijie Chen , Shuichi Hirahara , Hanlin Ren

In this paper we study asymptotic properties of families of zeta and $L$-functions over finite fields. We do it in the context of three main problems: the basic inequality, the Brauer--Siegel type results and the results on distribution of…

Number Theory · Mathematics 2013-10-29 Alexey Zykin

The asymptotic behavior of solutions to the second-order linear differential equation $d^{2}w/dz^{2}=\{u^{2}f(\alpha,z)+g(z)\}w$ is analyzed for a large real parameter $u$ and $\alpha\in[0,\alpha_{0}]$, where $\alpha_{0}>0$ is fixed. The…

Classical Analysis and ODEs · Mathematics 2025-12-24 T. M. Dunster

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Number Theory · Mathematics 2019-05-02 Kam Hung Yau
‹ Prev 1 8 9 10 Next ›