English
Related papers

Related papers: Electrical networks and Lagrangian Grassmannians

200 papers

We define and investigate algebraic torus actions on quiver Grassmannians for nilpotent representations of the equioriented cycle. Examples of such varieties are type $\tt A$ flag varieties, their linear degenerations, finite dimensional…

Representation Theory · Mathematics 2023-01-03 Martina Lanini , Alexander Pütz

In this {paper}, we consider holomorphic embeddings of $Gr(2,m)$ into $Gr(2,n)$. We study such embeddings by finding all possible total Chern classes of the pull-back of the universal bundles under these embeddings. Using the relations…

Algebraic Geometry · Mathematics 2017-02-16 Minhyuk Kwon

We introduce the notion of lattice path matroidal subdivisions, or LPM subdivisions for short, and show that these subdivisions are regular and hence the weight vectors for them lie in the Dressian. This leads us to explore the structure of…

Combinatorics · Mathematics 2023-07-11 Ayush Kumar Tewari , Ahmed Umer Ashraf

Let $\Gamma_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its…

Combinatorics · Mathematics 2025-05-05 Edyta Bartnicka , Andrzej Matraś

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

Combinatorics · Mathematics 2024-11-20 Kenta Noguchi , Carol T. Zamfirescu

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…

Group Theory · Mathematics 2024-01-15 Nick Gill , Pierre Guillot

Group equivariant convolutional neural networks (G-CNNs) are generalizations of convolutional neural networks (CNNs) which excel in a wide range of technical applications by explicitly encoding symmetries, such as rotations and…

Machine Learning · Computer Science 2022-09-14 Hannah Lawrence , Kristian Georgiev , Andrew Dienes , Bobak T. Kiani

For an incidence geometry $\mathcal{G} = (\mathcal{P}, \mathcal{L}, \text{I})$ with a linear representation $\mathcal{T}_n^*(\mathcal{K})$, we apply WQH switching to construct a non-geometric graph $\Gamma'$ cospectral with the line graph…

Combinatorics · Mathematics 2022-04-26 Ferdinand Ihringer

We show that general isotropic flags for odd-orthogonal and symplectic groups are general for Schubert calculus on the classical Grassmannian in that Schubert cells defined by such flags meet transversally. This strengthens a result of…

Algebraic Geometry · Mathematics 2008-07-21 Frank Sottile

We define and study the totally nonnegative part of the Chow quotient of the Grassmannian, or more simply the nonnegative configuration space. This space has a natural stratification by positive Chow cells, and we show that nonnegative…

Combinatorics · Mathematics 2022-09-01 Nima Arkani-Hamed , Thomas Lam , Marcus Spradlin

We introduce constructions of exact Lagrangian cobordisms with cylindrical Legendrian ends and study their invariants which arise from Symplectic Field Theory. A pair $(X,L)$ consisting of an exact symplectic manifold $X$ and an exact…

Symplectic Geometry · Mathematics 2012-12-27 Tobias Ekholm , Ko Honda , Tamás Kálmán

Most existing neural networks for learning graphs address permutation invariance by conceiving of the network as a message passing scheme, where each node sums the feature vectors coming from its neighbors. We argue that this imposes a…

Machine Learning · Computer Science 2018-01-09 Risi Kondor , Hy Truong Son , Horace Pan , Brandon Anderson , Shubhendu Trivedi

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…

Combinatorics · Mathematics 2024-05-23 Jing Wang , Xidao Luan , Yuanqiu Huang

Let {\Gamma} be a directed graph and Inv({\Gamma}) be the graph inverse semigroup of {\Gamma}. Luo and Wang [7] showed that the congruence lattice C(Inv({\Gamma})) of any graph inverse semigroup Inv({\Gamma}) is upper semimodular, but not…

Group Theory · Mathematics 2023-03-29 Yongle Luo , Zhengpan Wang , Jiaqun Wei

In this paper, based on a systematic formulation of Lax pairs, we show \textit{classical} integrability for nonrelativistic strings propagating over \textit{stringy} Newton-Cartan (NC) geometry. We further construct the corresponding…

High Energy Physics - Theory · Physics 2020-03-17 Dibakar Roychowdhury

Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…

Combinatorics · Mathematics 2017-11-29 Hui Zhou , Qi Ding , Ruiling Jia

In the framework of Lagrangian perturbation theory in general relativity we discuss the possibility to split the Einstein equations, written in terms of spatial Cartan coframes within a 3+1 foliation of spacetime, into gravitoelectric and…

General Relativity and Quantum Cosmology · Physics 2016-02-02 Fosca Al Roumi , Thomas Buchert

We develop the geometric and homological framework for non-commutative $n$-ary $\Gamma$-semirings by constructing a sheaf and derived theory over their non-commutative $\Gamma$-spectrum. Starting with a non-commutative $n$-ary…

Rings and Algebras · Mathematics 2025-12-02 Chandrasekhar Gokavarapu

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…

Combinatorics · Mathematics 2019-02-12 Michael Drmota , Éric Fusy , Mihyun Kang , Veronika Kraus , Juanjo Rué

Can complex engineered and biological networks be coarse-grained into smaller and more understandable versions in which each node represents an entire pattern in the original network? To address this, we define coarse-graining units (CGU)…

Molecular Networks · Quantitative Biology 2009-11-10 Shalev Itzkovitz , Reuven Levitt , Nadav Kashtan , Ron Milo , Michael Itzkovitz , Uri Alon
‹ Prev 1 8 9 10 Next ›