Related papers: Blurred constitutive laws and bipotential convex c…
When the electrically thin unit cell of a laminated composite material is made of two bianisotropic sheets whose constitutive properties in the thickness direction are decoupled from the constitutive properties in the interfacial planes,…
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…
We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…
The family Blow Up formula is recalled. Certain combinatoric graphs are introduced for the discussion of the counting of nodal curves on an Kahler surface.
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…
This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic…
In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
We propose a Bayesian methodology for one-mode projecting a bipartite network that is being observed across a series of discrete time steps. The resulting one mode network captures the uncertainty over the presence/absence of each link and…
A method for revealing the covariance matrix of an unknown two-mode Gaussian state is given based on the interference with a reference twin beam whose covariance matrix is known. In the method, first- and second-order cross-correlation…
In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…
In this paper we examine the existence of bicomplexied inverse Laplacetransform as an extension of its complexied inverse version within theregion of convergence of bicomplex Laplace transform. In this course weuse the idempotent…
The BPS spectrum of certain N=2 supersymmetric field theories can be determined algebraically by studying the representation theory of BPS quivers. We introduce methods based on BPS quivers to study line defects. The presence of a line…
Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of view. The equivalence between \emph{optimization} and…
To model rupture dynamics, a friction law must be assumed. Commonly used constitutive laws for modeling friction include slip-weakening laws which are characterized by a drop from static to dynamic frictional stress. Within this framework,…
We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…