English
Related papers

Related papers: Electrical Networks, Lagrangian Grassmannians and …

200 papers

We study the Riemannian geometry of the Deep Linear Network (DLN) as a foundation for a thermodynamic description of the learning process. The main tools are the use of group actions to analyze overparametrization and the use of Riemannian…

Machine Learning · Computer Science 2026-05-22 Govind Menon , Tianmin Yu

Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…

Combinatorics · Mathematics 2025-07-21 Ali Ghalavand , Sandi Klavžar , Xueliang Li

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

Combinatorics · Mathematics 2023-01-18 Mark Pankov

A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…

Information Theory · Computer Science 2018-04-11 Ilaria Cardinali , Luca Giuzzi

Local gauge structures play a central role in a wide range of condensed matter systems and synthetic quantum platforms, where they emerge as effective descriptions of strongly correlated phases and engineered dynamics. We introduce a…

Strongly Correlated Electrons · Physics 2026-05-06 Ali Rayat , Gia-Wei Chern

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

Combinatorics · Mathematics 2019-07-16 Christopher Hoffman , Matthew Kahle , Elliot Paquette

Lie subalgebras of $ L = \mathfrak{g}(\!(x)\!) \times \mathfrak{g}[x]/x^n\mathfrak{g}[x] $, complementary to the diagonal embedding $\Delta$ of $ \mathfrak{g}[\![x]\!] $ and Lagrangian with respect to some particular form, are in bijection…

Rings and Algebras · Mathematics 2023-05-31 Raschid Abedin , Stepan Maximov , Alexander Stolin

Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…

Let $\mathcal S$ be a Desarguesian $(t-1)$--spread of $PG(rt-1,q)$, $\Pi$ a $m$-dimensional subspace of $PG(rt-1,q)$ and $\Lambda$ the linear set consisting of the elements of $\mathcal S$ with non-empty intersection with $\Pi$. It is known…

Combinatorics · Mathematics 2015-09-28 Luca Giuzzi , Valentina Pepe

Given a complex structure $J$ on a real (finite or infinite dimensional) Hilbert space $H$, we study the geometry of the Lagrangian Grassmannian $\Lambda(H)$ of $H$, i.e. the set of closed linear subspaces $L\subset H$ such that…

Differential Geometry · Mathematics 2009-11-13 Esteban Andruchow , Gabriel Larotonda

An embedding of a point-line geometry \Gamma is usually defined as an injective mapping \epsilon from the point-set of \Gamma to the set of points of a projective space such that \epsilon(l) is a projective line for every line l of \Gamma,…

Algebraic Geometry · Mathematics 2013-03-25 Ilaria Cardinali , Antonio Pasini

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

Geometric Topology · Mathematics 2023-12-13 Benjamin Barrett , David Hume , Larry Guth , Elia Portnoy

We initiate a study of the representation of the symmetric group on the multilinear component of an $n$-ary generalization of the free Lie algebra, which we call a free LAnKe. Our central result is that the representation of the symmetric…

Combinatorics · Mathematics 2021-01-26 Tamar Friedmann , Phil Hanlon , Richard P. Stanley , Michelle L. Wachs

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian, denoted by $\lambda_r(m)$, among all $r$-uniform hypergraphs of fixed size $m$ is achieved by the minimum hypergraph $C_{r,m}$ under the colexicographic order. We say $m$…

Combinatorics · Mathematics 2018-07-02 Hui Lei , Linyuan Lu

Starting from a real standard subspace of a Hilbert space and a representation of the translation group with natural properties, we construct and analyze for each endomorphism of this pair a local, translationally covariant net of standard…

Mathematical Physics · Physics 2015-06-19 Gandalf Lechner , Roberto Longo

We describe embeddings of $n$-dimensional Lorentzian manifolds, including Friedmann-Lema\^itre-Robertson-Walker spaces, in $\mathbb{R}^{n+2}$ such that the metrics of the submanifolds are inherited by a restriction from that of…

Mathematical Physics · Physics 2024-03-19 E. Huguet , J. Queva , J. Renaud

We consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field and its subgraph $\Gamma(n,k)_q$ formed by non-degenerate linear $[n,k]_q$ codes. We assume that $1<k<n-1$. It is…

Combinatorics · Mathematics 2022-09-30 Mark Pankov

Let $D$ denote a quaternion division algebra over a non-archimedean local field $F$ with characteristic zero. Let $Sp_n(D)$ be the unique non-split inner form of the symplectic group $Sp_{2n}(F)$. An irreducible admissible representation…

Representation Theory · Mathematics 2024-07-15 Hariom Sharma , Mahendra Kumar Verma

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Combinatorics · Mathematics 2018-06-01 V. I. Zhukov

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…

Combinatorics · Mathematics 2025-07-01 Abdul Hameed , Mikhail Tyaglov
‹ Prev 1 4 5 6 7 8 10 Next ›