Related papers: Constructing isostatic frameworks for the $\ell^\i…
Given a fibration over the circle, we relate the eigenspace decomposition of the algebraic monodromy, the homological finiteness properties of the fiber, and the formality properties of the total space. In the process, we prove a more…
A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…
Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…
In this note we establish the existence of a new type of rigidity of symplectic embeddings coming from obligatory intersections with symplectic planes. More precisely, we prove that if a Euclidean ball is symplectically embedded in the…
Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal…
Two classes of non-linear elastic materials are derived via two-dimensional homogenization. These materials are equivalent to a periodic grid of axially-deformable and axially-preloaded structural elements, subject to incremental…
We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…
We consider three-dimensional elastic frames constructed out of Euler-Bernoulli beams and describe extension of matching conditions by relaxing the vertex-rigidity assumption and the case in which concentrated mass may exists. This…
We provide an analytical solution for the elastic fields in a two-dimensional unbounded isotropic body with a rigid inclusion. Our analysis is based on the boundary integral formulation of the elastostatic problem and geometric function…
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the…
We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…
Let $X$ be a connected non-compact $2$-dimensional manifold possibly with boundary and $\Delta$ be a foliation on $X$ such that each leaf $\omega\in\Delta$ is homeomorphic to $\mathbb{R}$ and has a trivially foliated neighborhood. Such…
Two non-overlapping domain decomposition methods are presented for the mixed finite element formulation of linear elasticity with weakly enforced stress symmetry. The methods utilize either displacement or normal stress Lagrange multiplier…
We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We…
We introduce a rigorous approach to the study of the symmetry breaking and pattern formation phenomenon for isotropic functionals with local/nonlocal interactions in competition. We consider a general class of nonlocal variational problems…