相关论文: Frames over finite fields: Equiangular lines in or…
The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…
We address the problem of covering a target segment $\overline{uv}$ using a finite set of guards $\mathcal{S}$ placed on a source segment $\overline{xy}$ within a simple polygon $\mathcal{P}$, assuming weak visibility between the target and…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
We derive regularized contour dynamics equations for the motion of infinite sharp fronts in the two-dimensional incompressible Euler, surface quasi-geostrophic (SQG), and generalized surface quasi-geostrophic (gSQG) equations. We derive a…
$\SLR$ geometry is one of the eight 3-dimensional Thurston geometries, it can be derived from the 3-dimensional Lie group of all $2\times 2$ real matrices with determinant one. Our aim is to describe and visualize the {\it regular infinite…
Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular…
For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…
In this paper, we introduce an algebro-geometric formulation for Siegel's theorem using an improvement of Lang's version of Roth's theorem over finitely generated fields of characteristic zero. In fact, we prove that, for an affine open…
A framework (a straight-line embedding of a graph into a normed space allowing edges to cross) is globally rigid if any other framework with the same edge lengths with respect to the chosen norm is an isometric copy. We investigate global…
In this paper the geometric entanglement (GE) of systems in one spatial dimension (1D) and in the thermodynamic limit is analyzed focusing on two aspects. First, we reexamine the calculation of the GE for translation-invariant matrix…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…
There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with difficulties in computing maximum…
Configurations of subspaces like equichordal and equiisoclinic tight fusion frames, which are in some sense optimally spread apart and which also have reconstruction properties emulating those of orthonormal bases, are useful in various…
Given a graph $G = (V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S \subseteq V$ of size at most $k$ such that for each terminal pair $\{u,v\} \in T$, the set $S$ intersects at…
We classify the allowed structures of the discrete 1-form gauge sector in six-dimensional supergravity theories realized as F-theory compactifications. This provides upper bounds on the 1-form gauge factors $\mathbb{Z}_m$ and in particular…
A set of lines in $\mathbb{R}^d$ passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-point semidefinite constraints developed by Bachoc and…
The effective field theory (EFT) framework is a precise approximation procedure when the inherent assumptions of a large-scale separation between the Standard Model (SM) and new interactions alongside perturbativity are realised.…
We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…
Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…
We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer-Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are…