Related papers: Exact trace formulae for a class of one-dimensiona…
Specification languages are essential in deductive program verification, but they are usually based on first-order logic, hence less expressive than the programs they specify. Recently, trace specification logics with fixed points that are…
For scattering systems consisting of a (family of) maximal dissipative extension(s) and a selfadjoint extension of a symmetric operator with finite deficiency indices, the spectral shift function is expressed in terms of an abstract…
Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…
Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. We study the computation of "matrices of traces" for the…
Relying on Feynman-Kac path-integral methodology, we present a new statistical perspective on wave single-scattering by complex three-dimensional objects. The approach is implemented on three models -- Schiff approximation, Born…
In the spirit of Arthur's trace formula, we establish a general trace formula for symmetric spaces associated with the variety of involutions of a finite $D$-module where $D$ is a division algebra central over a number field $F$. Such a…
In [5], Hochschild established a 6-term exact sequence for the cohomology of restricted Lie algebras. We generalize this result to restricted Lie superalgebras.
Spatiotemporal patterns, which are of interest in statistical physics and nonlinear dynamics, form on the tape-peeling trace. Recently, we have proposed a mathematical model to describe these pattern formation in the tape-peeling trace. In…
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…
We present exact bounce solutions and amplitudes for tunneling in i) a piecewise linear-quartic potential and ii) a piecewise quartic-quartic potential. We cross check their correctness by comparing with results obtained through the…
We construct a symmetric spectrum representing the G-equivariant K-theory of C*-algebras for a compact group or a proper groupoid G. Our spectrum is functorial for equivariant *-homomorphisms. We use this to establish the additivity of the…
We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source $s$ and a destination $t$, find the smallest subset of vertices whose intersection with any…
1-planar graphs are graphs that can be drawn in the plane such that any edge intersects with at most one other edge. Ackerman showed that the edges of a 1-planar graph can be partitioned into a planar graph and a forest, and claims that the…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that…
We define the rigid homology. The trace morphism in rigid cohomology define by duality the cycle class in rigid homology. We verify the compatibility of this classes with rationnal equivalence and intersection theory. We deduce some formal…
We consider the notion of discrete Ricci curvature for graphs defined by Schmuckenschl{\"a}ger \cite{shmuck} and compute its value for Bruhat graphs associated to finite Coxeter groups. To do so we work with the geometric realization of a…
Inspired by applications of perfect graphs in combinatorial optimization, Chv\'{a}tal defined t-perfect graphs in 1970s. The long efforts of characterizing t-perfect graphs started immediately, but embarrassingly, even a working conjecture…
Let $X$ be a real algebraic variety with set of complex points $X_{\mathbb C}$ and set of real points $X_{\mathbb R}$. A complex slice of $X$ is a transverse intersection of $X_{\mathbb R}$ with a complex subvariety $V$ of $X_{\mathbb C}$.…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…