Related papers: Higher Order Rigidity and Energy
In this study, the nonconforming finite elements of order two and order three are constructed and exploited for the Stokes problem. The moments of order up to $k-1$ ($k=2,3$) on all the facets of the tetrahedron are used for DoFs (degrees…
We study higher-order theories of gravitation; in particular, we will focus our attention on the second-order theory, in which conformal symmetry can be implemented.
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
We construct the complete set of orders of growth and we define on it the generalized entropy of a dynamical systems. With this object we provide a framework where we can study the separation of orbits of a map beyond the scope of…
Fourth-derivative gravity has two free parameters, $\alpha$ and $\beta$, which couple the curvature-squared terms $R^2$ and $R_{\mu\nu}^2$. Relativistic effects and short-range laboratory experiments can be used to provide upper limits to…
For homogeneous higher gradient elasticity models we discuss frame-indifference and isotropy requirements. To this end, we introduce the notions of local versus global SO(3)-invariance and identify frame-indifference (traditionally) with…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of $O(\epsilon^{-3/2})$ proved by Cartis, Gould and Toint (IMAJNA 32(4) 2012, pp.1662-1695) for computing an…
This paper investigates certain classes of entire functions in C^n that, together with their partial derivatives, share a finite set consisting of three elements. By employing normality criteria, we study the behaviour of such functions and…
In a recent short note the first author gave the first positive result on the higher order regularity of the discrete noncentered Hardy-Littlewood maximal function. In this article we conduct a thorough investigation of possible similar…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
In certain point processes, the configuration of points outside a bounded domain determines, with probability 1, certain statistical features of the points within the domain. This notion, called rigidity, was introduced in a work of Ghosh…
In this work we propose and analyze a new Hybrid High-Order method for the Brinkman problem for fluids with power-law viscosity. The proposed method supports general meshes and arbitrary approximation orders and is robust in all regimes,…
Higher order derivatives of functions are structured high dimensional objects which lend themselves to many alternative representations, with the most popular being multi-index, matrix and tensor representations. The choice between them…
We show a new simple algorithm that checks whether a given higher-order grammar generates a nonempty language of trees. The algorithm amounts to a procedure that transforms a grammar of order n to a grammar of order n-1, preserving…
In many applications, it is impractical -- if not even impossible -- to obtain data to fit a known cubature formula (CF). Instead, experimental data is often acquired at equidistant or even scattered locations. In this work, stable (in the…
Many loads have flexibility in demand that can be used to provide ancillary services to power grids. A large body of literature exists on designing algorithms to coordinate actions of many loads to provide such a service. The topic of…
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following.…