Related papers: Infinitely many solutions for a biharmonic-Kirchho…
We show that in random $K$-uniform hypergraphs of constant average degree, for even $K \geq 4$, local algorithms defined as factors of i.i.d. can not find nearly maximal cuts, when the average degree is sufficiently large. These algorithms…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
In this paper, we extend the investigations regarding Birkhoff-James orthogonality of linear operators to bounded continuous functions on metric spaces. We introduce Birkhoff-James extensions of continuous functions and study them in…
A bifurcation is a qualitative change in a family of solutions to an equation produced by varying parameters. In contrast to the local bifurcations of dynamical systems that are often related to a change in the number or stability of…
A new linear relaxation system for nonconservative hyperbolic systems is introduced, in which a nonlocal source term accounts for the nonconservative product of the original system. Using an asymptotic analysis the relaxation limit and its…
In this paper, existence of solutions is established for critical exponential Kirchhoff systems on the Heisenberg group by using the variational method. The novelty of our paper is that not only the nonlinear term has critical exponential…
In this paper, a critical fourth-order Kirchhoff type elliptic equation with a subcritical perturbation is studied. The main feature of this problem is that it involves both a nonlocal coefficient and a critical term, which bring essential…
This is part II of a two-part paper. Part I presented a universal Birkhoff theory for fast and accurate trajectory optimization. The theory rested on two main hypotheses. In this paper, it is shown that if the computational grid is selected…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
The fact that potentially skilled, but biologically later-maturing athletes are less likely to be selected into talent development programmes can represent a failure of Talent Identification in sports. In this article, we prove the…
The diagonal entries of pseudoinverse of the Laplacian matrix of a graph appear in many important practical applications, since they contain much information of the graph and many relevant quantities can be expressed in terms of them, such…
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
In this paper we focus on different -- global, semi-local and local -- versions of Hoffman type inequalities expressed in a variational form. In a first stage our analysis is developed for generic multifunctions between metric spaces and we…
In this paper we investigate a class of elliptic problems involving a nonlocal Kirchhoff type operator with variable coefficients and data changing its sign. Under appropriated conditions on the coefficients, we have shown existence and…
Some rigorous results and statistics of the solution space of Vertex-Covers on bipartite graphs are given in this paper. Based on the $K\ddot{o}nig$'s theorem, an exact solution space expression algorithm is proposed and statistical…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
We develop a new theory for treating boundary problems for linear ordinary differential equations whose fundamental system may have a singularity at one of the two endpoints of the given interval. Our treatment follows an algebraic…
In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide class of {\em local} matching algorithms, namely, algorithms…