Related papers: Graphs of multifunctions
A simple graph $G$ with maximum degree $\Delta$ is \emph{overfull} if $|E(G)|>\Delta \lfloor |V(G)|/2\rfloor$. The \emph{core} of $G$, denoted $G_{\Delta}$, is the subgraph of $G$ induced by its vertices of degree $\Delta$. Clearly, the…
Motivated by Alladi's recent multi-dimensional generalization of Sylvester's classical identity, we provide a simple combinatorial proof of an overpartition analogue, which contains extra parameters tracking the numbers of overlined parts…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
We deal with the existence of three distinct solutions for a poly-Laplacian system with a parameter on finite graphs and a $(p,q)$-Laplacian system with a parameter on locally finite graphs.The main tool is an abstract critical points…
We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game…
We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…
Given a family of pairs of modules parametrised by a smooth space Y, the Multiplicity-Polar Theorem relates the multiplicity of the pair of modules at a special point of the parameter to the multiplicity of the pair at a generic point. This…
We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can…
We introduce a quantity which measures the singularity of a plurisubharmonic function f relative to another plurisubharmonic function g, at a point a. This quantity, which we denote by $\nu_{a,g}(f)$, can be seen as a generalization of the…
A pair of ovservations on the role of projective geometrical dualities in graphic statics.
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.
The hyperanalytic signal is the straight forward generalization of the classical analytic signal. It is defined by a complexification of two canonical complex signals, which can be considered as an inverse operation of the Cayley-Dickson…
In connection to a conjecture of W. L\"u. Q. Li and C. Yang we prove a result on small function sharing by a power of a meromorphic function with few poles and its derivative. Our results improve a number of known results.
This article is devoted to studying multiplicity and regularity of real analytic sets. We present an equivalence for real analytic sets, named blow-spherical equivalence, which generalizes differential equivalence and subanalytic…
Let C be real-analytic simple closed curve in the complex plane which is symmetric with respect to the real axis. Let r>0 be such that C+ir misses C-ir. We prove that if a continuous function f extends holomorphically from C+it for each t…
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most \(1\) chip on each…
The topic of stable matchings (marriages) in a bipartite graph has become widely popular, starting with the appearance of the classical work by Gale and Shapley. We give a detailed survey on selected known results in this field that…
We describe a graph parametrization of rational quadratic differentials with presence of a simple pole, whose critical trajectories form a network depending on parameters focusing on the network topological jumps. Obtained bifurcation…
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
For a given spectral curve, we construct a family of symplectic dual spectral curves for which we prove an explicit formula expressing the $n$-point functions produced by the topological recursion on these curves via the $n$-point functions…