Related papers: Extension preservation on dense graph classes
This paper proposes a standard way to represent sparse tensors. A broad theoretical framework for tensor data scattering methods used in various deep learning frameworks is established. This paper presents a theorem that is very important…
We derive sufficient conditions for exact functors on locally finite abelian categories to preserve Loewy diagrams of objects. We apply our results to determine sufficient conditions for induction functors associated to simple current…
We establish the equations which translate a conservation law for the problem of the seismic response of an above-ground structure (e.g., building, hill or mountain) of arbitrary shape and inquire whether both the implicit (formal) and…
This paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes to encode tree discontinuities…
Extensions (entropies) play a central role in the theory of hyperbolic conservation laws by providing intrinsic selection criteria for weak solutions. For a given hyperbolic system u_t+f(u)_x=0, a standard approach is to analyze directly…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We study linear time dispersive and dissipative systems. Very often such systems are not conservative and the standard spectral theory can not be applied. We develop a mathematically consistent framework allowing (i) to constructively…
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However,…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
We develop sufficient analytic conditions for conservativeness of non-sectorial perturbations of symmetric Dirichlet forms which can be represented through a carr\'e du champ on a locally compact separable metric space. These form an…
We study possibilities of preservations for properties, their links and related connections between semantic and syntactic ones, both in general and as characterizations for subalgebras, congruence relations, Henkin construction,…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
In this work we consider the problem on group classification and conservation laws of the general first order evolution equations. We obtain the subclasses of these general equations which are quasi-self-adjoint and self-adjoint. By using…
One perspective on tree decompositions is that they display (low-order) separations of the underlying graph or matroid. The separations displayed by a tree decomposition are necessarily nested. In 2013, Clark and Whittle proved the…
We study the first-order (FO) model checking problem of dense graphs, namely those which have FO interpretations in (or are FO transductions of) some sparse graph classes. We give a structural characterization of the graph classes which are…
We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…
We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a…
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…