惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

MongoDB | Blog
MongoDB | Blog
罗磊的独立博客
美团技术团队
B
Blog
量子位
The Cloudflare Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
aimingoo的专栏
aimingoo的专栏
The GitHub Blog
The GitHub Blog
博客园 - 聂微东
P
Proofpoint News Feed
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
D
DataBreaches.Net
博客园 - 三生石上(FineUI控件)
Y
Y Combinator Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Vercel News
Vercel News
Blog — PlanetScale
Blog — PlanetScale
云风的 BLOG
云风的 BLOG
Microsoft Azure Blog
Microsoft Azure Blog
有赞技术团队
有赞技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
阮一峰的网络日志
阮一峰的网络日志
S
SegmentFault 最新的问题

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Implicit Linear Algebra and Basic Circuit Theory II: port...
H. Narayanan · 2021-03-08 · via math.CO updates on arXiv.org

In this paper, we define the notion of rigidity for linear electrical multiports and for matroid pairs. We show the parallel between the two and study the consequences of this parallel. We present applications to testing, using purely matroidal methods, whether a connection of rigid multiports yields a linear network with unique solution. We also indicate that rigidity can be regarded as the closest notion to duality that can be hoped for, when the spaces correspond to different physical constraints, such as topological and device characteristic. A multiport is an ordered pair $(\V^1_{AB},\A^2_{B}),$ where $\V^1_{AB}$ is the solution space on $A\uplus B$ of the Kirchhoff current and voltage equations of the graph of the multiport and $\A^2_{B}\equivd α_B+\V^2_B$ is the device characteristic of the multiport, with $A$ corresponding to port voltages and currents and $B$ corresponding to internal voltages and currents. The pair $\{\V^1_{AB},α_B+\V^2_{B}\}$ is said to be rigid iff it has a solution $(x_A,x_B)$ for every vector $α_B$ and given a restriction $x_A$ of the solution, $x_B$ is unique. A matroid $\M_S$ on $S,$ is a family of `independent' sets with the property that maximal independent sets contained in any given subset of $S$ have the same cardinality. The pair $\{\M^1_{AB},\M^2_{B}\}$ is said to be rigid iff the two matroids have disjoint bases which cover $B.$ We show that the properties of rigid pairs of matroids closely parallel those of rigid multiports. We use the methods developed in the paper to show that a multiport with independent and controlled sources and positive or negative resistors, whose parameters can be taken to be algebraically independent over $\Q,$ is rigid, if certain simple topological conditions are satisfied by the device edges.