Related papers: Logarithmically Regular Morphisms
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…
Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility. When facing complex domains, such as positive semi-definite cones, the projection operation…
In this paper we discuss the structure of weighted weak Lebesgue spaces and weighted weak Orlicz spaces on $\mathbb{R}^n$. First, we present sufficient and necessary conditions for inclusion relation between weighted weak Lebesgue spaces.…
The It{\^o} map assigns the solution of a Rough Differential Equation, a generalization of an Ordinary Differential Equation driven by an irregular path, when existence and uniqueness hold. By studying how a path is transformed through the…
The rigidity problem for uniform Roe algebras was recently positively solved. Before its solution was found, there were positive solutions under the assumption of certain technical geometric conditions. In this paper, we introduce weaker…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…
We derive some local properties of abstract crystals with logarithmic poles over a smooth base in positive characteristic and obtain the existence of the canonical coordinates of certain ordinary crystals. We then apply the results to…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
In this article, we prove the comparison theorem between the relative log de Rham-Witt cohomology and the relative log crystalline cohomology for a log smooth saturated morphism of fs log schemes satisfying certain condition. Our result…
We study the structure of a log smooth pair when the equality holds in the Bogomolov-Gieseker inequality for the logarithmic tangent bundle and this bundle is semistable with respect to some ample divisor. We also study the case of the…
We study the smoothness of paging algorithms. How much can the number of page faults increase due to a perturbation of the request sequence? We call a paging algorithm smooth if the maximal increase in page faults is proportional to the…
We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…
We show the smoothness over the affine line of the Hodge moduli space of logarithmic t-connections of coprime rank and degree on a smooth projective curve with geometrically integral fibers over an arbitrary Noetherian base. When the base…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…
The combinatorial problem of learning directed acyclic graphs (DAGs) from data was recently framed as a purely continuous optimization problem by leveraging a differentiable acyclicity characterization of DAGs based on the trace of a matrix…
Let $M$ be a smooth projective variety and $\mathbf{D}$ an ample normal crossings divisor. From topological data associated to the pair $(M, \mathbf{D})$, we construct, under assumptions on Gromov-Witten invariants, a series of…
In the article of Hesselholt [Hes05], a set of conjectures is laid out. Given a smooth scheme $X$ over the ring of integers $\mathcal{O}_K$ of a $p$-adic field $K$, these conjectures concern the expected relation between log topological…