Related papers: Parameterized Resolution with bounded conjunction
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that…
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…
We obtain the radial symmetry of the solution to a partially overdetermined boundary value problem in a convex cone in space forms by using the maximum principle for a suitable subharmonic function $P$ and integral identities. In dimension…
The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…
This paper proposes an algorithm for computing regularized solutions to linear rational expectations models. The algorithm allows for regularization cross-sectionally as well as across frequencies. A variety of numerical examples illustrate…
We construct a refined bijection $\phi$ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation $\pi$ is equal to the first vertex in $\phi(\pi)$ in…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence…
In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent…
We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient…
We develop two methods to reconstruct a path of bounded variation from its signature. The first method gives a simple and explicit expression of any axis path in terms of its signature, but it does not apply directlty to more general ones.…
We establish a Schn$\ddot{\text{u}}$rer's convergence result and then apply it to obtain the existence of solutions on the second boundary value problem for a family of special Lagrangian equations
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape estimation to inference about sets. Currently existing…
Recently, we introduced Relative Resolution as a hybrid formalism for fluid mixtures [1]. The essence of this approach is that it switches molecular resolution in terms or relative separation: While nearest neighbors are characterized by a…
In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem - above the maximum separating cut and above a natural LP-relaxation - and prove them to be fixed-parameter tractable. Our results imply…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
We consider a semilinear elliptic problem in an annulus of R^N, with N>1. Recent results ensure that there exists a sequence p_k of exponents of the nonlinear term at which a nonradial bifurcation from the radial solution occurs. Exploiting…
This paper deals with various cases of resonance, which is a fundamental concept of science and engineering. Specifically, we study the connections between periodic and unbounded solutions for several classes of equations and systems. In…
The bivariate difference field provides an algebraic framework for a sequence satisfying a recurrence of order two. Based on this, we focus on sequences satisfying a recurrence of higher order, and consider the multivariate difference…