Related papers: Euler Coefficients and Restricted Dyck Paths

We consider a parabolic obstacle problem for Euler's elastic energy of graphs with fixed ends. We show global existence, well-posedness and subconvergence provided that the obstacle and the initial datum are suitably 'small'. For symmetric…

The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization.…

We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…

We introduce a deformed version of Dyck paths (DDP), where additional to the steps allowed for Dyck paths, 'jumps' orthogonal to the preferred direction of the path are permitted. We consider the generating function of DDP, weighted with…

In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph G=(V,E) and a subset T of V of so-called terminal vertices, the problem is to find a minimum number of vertex-disjoint simple…

We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…

Long Paths and Cycles in eulerian digraphs have gotten a lot of attention recently. In this short note, we show how to use methods from Knierim, Larcher, Martinsson, Noever (2021) to find paths of length $d/(\log d+1)$ in Eulerian digraphs…

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

We generalize the fractional variational problem by allowing the possibility that the lower bound in the fractional derivative does not coincide with the lower bound of the integral that is minimized. Also, for the standard case when these…

We prove the existence of explicit linear multistep methods of any order with positive coefficients. Our approach is based on formulating a linear programming problem and establishing infeasibility of the dual problem. This yields a number…

We consider the Calder\'on problem in the case of partial Dirichlet-to-Neumann map for the system of elliptic equations in a bounded two dimensional domain. The main result of the manuscript is as follows: If two systems of elliptic…

The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…

We propose and analyze a variation of the Euler scheme for state constrained ordinary differential inclusions under weak assumptions on the right-hand side and the state constraints. Convergence results are given for the space-continuous…

An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves a fractional power of an elliptic operator of second order. Finite element approximation in space is…

We consider a one dimensional elliptic distributed optimal control problem with pointwise constraints on the derivative of the state. By exploiting the variational inequality satisfied by the derivative of the optimal state, we obtain…

We consider stochastic differential equations driven by a general L\'evy processes (SDEs) with infinite activity and the related, via the Feynman-Kac formula, Dirichlet problem for parabolic integro-differential equation (PIDE). We…

We propose a new proximal, path-following framework for a class of constrained convex problems. We consider settings where the nonlinear---and possibly non-smooth---objective part is endowed with a proximity operator, and the constraint set…

We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called…

Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the $x$-axis. We present enumerative results on GDAP (or their prefixes) subject to various restrictions such as…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…