Related papers: Parameterized Resolution with bounded conjunction
We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
Structural models that admit multiple reduced forms, such as game-theoretic models with multiple equilibria, pose challenges in practice, especially when parameters are set-identified and the identified set is large. In such cases,…
We give characterizations for the parabolicity of regular trees.
We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The…
We investigate the parameterized complexity in $a$ and $b$ of determining whether a graph~$G$ has a subset of $a$ vertices and $b$ edges whose removal disconnects $G$, or disconnects two prescribed vertices $s, t \in V(G)$.
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
In different Wolfenstein parametrizations derived from different exact parametrizations of the Cabibbo-Kobayashi-Maskawa matrix, we explicitly study seeming discrepancies between the matrix elements at the higher order of the expansion…
Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
In this paper we investigate the existence and uniqueness of bounded, periodic and almost periodic solutions for second order differential equations involving reflection of the argument.The relationship between frequency modules of forced…
We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…
We introduce the notions of mixed resolutions and simplicial sections, and prove a theorem relating them. This result is used (in another paper) to study deformation quantization in algebraic geometry.
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We investigate the first-order correction in the homogenization of linear parabolic equations with random coefficients. In dimension $3$ and higher and for coefficients having a finite range of dependence, we prove a pointwise version of…
We refine the conditions for the lower bound in an abstract large deviation result with nonconvex rate function we had previously introduced. We apply the results to certain stochastic recursive schemes.
We extend the classical deconvolution framework in Rn to the case with a pseudodifferential-like solution operator with a symbol depending on both the base and cotangent variable. Our framework enables deconvolution with spatially varying…