Related papers: Noncommutative Frames Revisited
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…
We prove that Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete. This implies the PSPACE-completeness of the spanning variant of Subgraph Reconfiguration under the token jumping rule for the property "a graph is an…
Motivated by an amazing integrality structure conjecture for the $U(N)$ Chern-Simons quantum invariants of framed knots investigated by Mari\~no and Vafa, a new conjectural formula, named Hecke lifting conjecture, was proposed in…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
We correct some oversights in the paper "A spectral sequence for stratified spaces and configuration spaces of points" by the second named author. In particular we explain that an additional hypothesis should be added to Theorem 4.15 in…
Lattice simulations can play an important role in the study of dynamical electroweak symmetry breaking by providing quantitative results on the nonperturbative dynamics of candidate theories. For this programme to succeed, it is crucial to…
For a slim, planar, semimodular lattice $L$ and covering square~$S$, G.~Cz\'edli and E.\,T.~Schmidt introduced the fork extension, $L[S]$, which is also a slim, planar, semimodular lattice. We investigate when a congruence of $L$ extends to…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
This paper addresses the problem of mixed-membership estimation in networks, where the goal is to efficiently estimate the latent mixed-membership structure from the observed network. Recognizing the widespread availability and valuable…
Skew braces are intensively studied owing to their wide ranging connections and applications. We generalize the definition of a skew brace to give a new algebraic object, which we term a skew bracoid. Our construction involves two groups…
G. Cz\'edli and E.\,T. Schmidt introduced in 2012 the fork extension. Continuing from Part I, we investigate the congruences of a fork extension. This paper has been merged with Part I, under the title Congruences of fork extensions of slim…
A. Smoktunowicz and L. Vendramin conjectured that if $A=(A,\oplus,\odot)$ is a finite skew brace with solvable additive group $A_{\oplus}$, then the multiplicative group $A_{\odot}$ of $A$ is also solvable. Proving or disproving this…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
We propose new symmetry-adapted rigidity matrices to analyze the infinitesimal rigidity of arbitrary-dimensional bar-joint frameworks with Abelian point group symmetries. These matrices define new symmetry-adapted rigidity matroids on…
Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…
We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…