相关论文: Minimal scalings and structural properties of scal…

We show the existence of O(f(c)k) sized vertex sparsifiers that preserve all edge-connectivity values up to c between a set of k terminal vertices, where f(c) is a function that only depends on c, the edge-connectivity value. This…

In this paper, we prove that any closed minimal hypersurface $M^4$ in the $5$-dimensional unit sphere $\mathbb{S}^5$ with constant scalar curvature and constant $3$-th mean curvature must be isoparametric. To be precise, $M^4$ is either an…

Given a network property or a data structure, a local certification is a labeling that allows to efficiently check that the property is satisfied, or that the structure is correct. The quality of a certification is measured by the size of…

The frequency dependence of the Raman coupling coefficient $C(\omega)$ is calculated numerically for square and cubic percolation clusters. No general scaling law in terms of the macroscopic parameters such as the fractal dimension $D$ or…

We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in…

In this work we give a method for constructing a one-parameter family of complete CMC-1 (i.e. constant mean curvature 1) surfaces in hyperbolic 3-space that correspond to a given complete minimal surface with finite total curvature in…

The scaling properties of the cluster size distribution of a system of diffusing clusters is studied in terms of a simple kinetic mean field model. It is shown that a one parameter family of mathematically valid scaling solutions exists.…

Let $f: \mathbb{R}^3 \rightarrow \mathbb{R}$ be a scalar field. An isosurface is a piecewise linear approximation of a level set $f^{-1}(\sigma)$ for some $\sigma \in \mathbb{R}$ built from some regular grid sampling of $f$. Isosurfaces…

The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $F\subseteq V(G)$ such that only the trivial automorphism of $G$ fixes every vertex in $F$. Let $\Pi$ $=$ $\{F_1,F_2,\ldots,F_k\}$ be an ordered $k$-partition…

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Let $f$ be a generalized affine recurrent fractal interpolation function with vertical scaling functions. In this paper, by introducing underlying local iterated function systems of $f$, we define restricted vertical scaling matrices. Then…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…

Based on further studying the low-rank subspace clustering (LRSC) and L2-graph subspace clustering algorithms, we propose a F-graph subspace clustering algorithm with a symmetric constraint (FSSC), which constructs a new objective function…

We present a general procedure to construct examples of convex scalar variational problems which admit a minimizers with large singular sets. The dimension of the set of singularities is maximal and the minimizer has no higher integrability…

For C a factorisable and pivotal finite tensor category over an algebraically closed field of characteristic zero we show: 1) C always contains a simple projective object; 2) if C is in addition ribbon, the internal characters of projective…

It was shown that the conventional Fock matrix calculation, which using stored non-zero two-electron integrals, density prescreening, and data compression methods possesses the linear scaling property with respect to the problem size. This…

Scaling of folding properties of proteins is studied in a toy system -- the lattice Go model with various two- and three- dimensional geometries of the maximally compact native states. Characteristic folding times grow as power laws with…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

Scale invariance is a central organizing principle in physics, underlying phenomena that range from critical behaviour in statistical mechanics to transport and chaos in nonlinear dynamical systems. Here we present a unified and physically…