Related papers: Logarithmically Regular Morphisms
The author constructs a theory of dagger formal schemes over $R$ and then defines the de Rham cohomology for flat dagger formal schemes $X$ with integral and regular reductions $\bar{X}$ which generalizes the Monsky-Washnitzer cohomology.…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
We establish a simultaneous generalization of It\^o's theory of stochastic and Lyons' theory of rough differential equations. The interest in such a unification comes from a variety of applications, including pathwise stochastic filtering,…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
In this work we develop a theory of motives for logarithmic schemes over fields in the sense of Fontaine, Illusie, and Kato. Our construction is based on the notion of finite log correspondences, the dividing Nisnevich topology on log…
Let $X$ be a quasiprojective scheme. In this expository note we collect a series of useful structural results on the stack $\mathscr{C}oh^n(X)$ parametrising $0$-dimensional coherent sheaves of length $n$ over $X$. For instance, we discuss…
Given a simple graph $G$, the artinian monomial algebra associated to $G$, denoted by $A(G)$, is defined by the edge ideal of $G$ and the squares of the variables. In this article, we classify some tadpole graphs $G$ for which $A(G)$ has or…
The first part of this report describes the following result that, logarithmic approximation factor for hard capacitated set cover can be achieved from Wolsey's work [9], using a simpler and more intuitive analysis. We further show in our…
In this paper, we review recent results on stability and instability in logarithmic Sobolev inequalities, with a particular emphasis on strong norms. We consider several versions of these inequalities on the Euclidean space, for the…
In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…
We prove an analogue of the weak Omori-Yau maximum principle and Khas'minskii's criterion for graphs in the general setting of Keller and Lenz. Our approach naturally gives the stability of stochastic incompleteness under certain surgeries…
Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…
We study the correlation functions of logarithmic conformal field theories. First, assuming conformal invariance, we explicitly calculate two-- and three-- point functions. This calculation is done for the general case of more than one…
Let $R$ be a strictly local ring complete for a discrete valuation, with fraction field $K$ and residue field of characteristic $p > 0$. Let $X$ be a smooth, proper variety over $K$. Nicaise conjectured that the rational volume of $X$ is…
We present complexity results regarding a matching-type problem related to structural controllability of dynamical systems modelled on graphs. Controllability of a dynamical system is the ability to choose certain inputs in order to drive…
We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…
The logarithmic slope of the diffractive structure function is a potential observable scanning the hard and soft contributions in diffraction, allowing to disentangle the QCD dynamics. We report our calculations concerning this quantity, in…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
Gaussian graphical models represent the underlying graph structure of conditional dependence between random variables which can be determined using their partial correlation or precision matrix. In a high-dimensional setting, the precision…