Related papers: Implicit Linear Algebra and Basic Circuit Theory I…
A {\em connectivity function on} a set $E$ is a function $\lambda:2^E\rightarrow \mathbb R$ such that $\lambda(\emptyset)=0$, that $\lambda(X)=\lambda(E-X)$ for all $X\subseteq E$ and that $\lambda(X\cap Y)+\lambda(X\cup Y)\leq…
We consider a family of non-linear theories of electromagnetism that interpolate between Born-Infeld at small distances and ModMax at large distances. These models are duality invariant and feature a $K-$mouflage screening in the…
Membrane-mediated particle interactions depend both on the properties of the particles themselves and the membrane environment in which they are suspended. Experiments have shown that chiral rod-like inclusions dissolved in a colloidal…
Recently the duality map between electric-like asymptotic charges of $p$-form gauge theories is studied. The outcome is an existence and uniqueness theorem and the topological nature of the duality map. The goal of this work is to extend…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Properties of Boolean functions on the hypercube invariant with respect to linear transformations of the domain are among the most well-studied properties in the context of property testing. In this paper, we study the fundamental class of…
We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
Bi-objective optimization problems on matroids are in general intractable and their corresponding decision problems are in general NP-hard. However, if one of the objective functions is restricted to binary cost coefficients the problem…
We introduce the operad Moor, dual of the operad NAP and the notion of Moor-bialgebras. We warn the reader that the compatibility relation linking the Moor-operation with the Moor-cooperation is not distributive in the sense of Loday.…
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…
Hybrid inverse problems are mathematical descriptions of coupled-physics (also called multi-waves) imaging modalities that aim to combine high resolution with high contrast. The solution of a high-resolution inverse problem, a first step…
This work considers the problem of estimating the unscaled relative positions of a multi-robot team in a common reference frame from bearing-only measurements. Each robot has access to a relative bearing measurement taken from the local…
We consider an array of dual-core waveguides, which represent an optical realization of a chain of dimers, with an active (gain-loss) coupling between the cores, opposite signs of discrete diffraction in the parallel arrays, and a…
Using a combination of theory and experiments we study the interface between two immiscible domains in a colloidal membrane composed of rigid rods of different lengths. Geometric considerations of rigid rod packing imply that a domain of…
Motivated by recently discovered connections between matroid depth measures and block-structured integer programming [ICALP 2020, 2022], we undertake a systematic study of recursive depth parameters for matrices and matroids, aiming to…
A general primal-dual splitting algorithm for solving systems of structured coupled monotone inclusions in Hilbert spaces is introduced and its asymptotic behavior is analyzed. Each inclusion in the primal system features compositions with…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…
B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…