Related papers: $k$-fold circuits and coning in rigidity matroids
Using duality in optimization theory we formulate a dual approach to the S-matrix bootstrap that provides rigorous bounds to 2D QFT observables as a consequence of unitarity, crossing symmetry and analyticity of the scattering matrix. We…
In 2013, Duch{\^e}ne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a labeled version of the graph packing problem. It led to the introduction of a new parameter for graphs, the k-labeled packing number $\lambda$ k. This parameter…
In 30's Hassler Whitney considered and completely solved the problem $(WP)$ of describing the classes of graphs $G$ having the same cycle matroid $M(G)$. A natural analog $(WP)'$ of Whitney's problem $(WP)$ is to describe the classes of…
Generic bifurcation theory was classically well developed for smooth differential systems, establishing results for $k$-parameter families of planar vector fields. In the present study we focus on a qualitative analysis of $2$-parameter…
We investigate some relations between the duality and the topological filtration in algebraic K-theory. As a result, we obtain a construction of the first Steenrod square for Chow groups modulo two of varieties over a field of arbitrary…
We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…
The Cartesian product of two cycles (of length m and length n) has a natural embedding on the torus, such that each face of the embedding is a 4-cycle. The toroidal grid Qd(m,n,r) is a generalization of this in which there is a shift by r…
A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine…
A main theme of the paper is a conjecture of Bloch-Kato on the image of $p$-adic regulator maps for a proper smooth variety $X$ over an algebraic number field $k$. The conjecture for a regulator map of particular degree and weight is…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
The study of the cone of submodular functions goes back to Jack Edmonds' seminal 1970 paper, which already highlighted the difficulty of characterizing its extreme rays. Since then, researchers from diverse fields have sought to…
By using certain idea developed in minimal submanifold theory we study rigidity problem for self-shrinkers in the present paper. We prove rigidity results for squared norm of the second fundamental form of self-shrinkers, either under…
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers $k,l$ the notions of $(k,l)$-rigid and $(k,l)$-stress free bipartite graphs. This…
For a finite point 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…
We consider the problem of finding an independent set of maximum weight simultaneously contained in $k$ matroids over a common ground set. This $k$-matroid intersection problem appears naturally in many contexts, for example in generalizing…
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…
We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978), and for the hypergraphs of circuits of a matroid…