Related papers: Logarithmically Regular Morphisms
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an amortized randomized Omega(lg n) lower bound per operation for several data structural problems on n elements,…
Recent work ([18], [1]) has produced a complete list of weighted homogeneous surface singularities admitting smoothings whose Milnor fibre has only trivial rational homology (a "rational homology disk"). Though these special singularities…
In this note, we give a formulation of log structures for derived stacks using Olsson's log stack. The derived cotangent complex is then Olsson's logarithmic cotangent complex, which (unlike Gabber's) is just given by log differential forms…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…
We introduce and study a notion of Castelnuovo-Mumford regularity suitable for rational normal scroll surfaces. In this setting we prove analogs of some classical properties. We prove splitting criteria for coherent sheaves and a…
In recent years, network models have gained prominence for their ability to capture complex associations. In statistical omics, networks can be used to model and study the functional relationships between genes, proteins, and other types of…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
We address the question of finding algebraic properties that are respectively equivalent, for a morphism between algebraic varieties over an algebraically closed field of characteristic zero, to be an homeomorphism for the Zariski topology…
We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…
Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…
We give a novel descriptive-complexity theoretic characterization of L and NL computable queries over finite structures using traversal invariance. We summarize this as (N)L = FO + (breadth-first) traversal-invariance.
Let $C\subset \mathbb P^3$ be a curve over an algebraically closed field of characteristic zero, and let $M(C)$ denote its Hartshorne-Rao module. We study how the geometry of $C$ influences whether $M(C)$ satisfies the Weak and Strong…
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…
We study the coordinate ring of an $L$-convex polyomino, determine its regularity in terms of the maximal number of rooks that can be placed in the polyomino. We also characterize the Gorenstein $L$-convex polyominoes and those which are…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
An action of a complex reductive group $\mathrm G$ on a smooth projective variety $X$ is regular when all regular unipotent elements in $\mathrm G$ act with finitely many fixed points. Then the complex $\mathrm G$-equivariant cohomology…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
Rough membership function defines the measurement of relationship between conditional and decision attribute from an Information system. In this paper we propose a new method to construct rough graph through rough membership function…