Related papers: Symmetrizable intersection matrices and their root…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
We associate a generalized root system in the sense of Kyoji Saito to an orbifold projective line via the derived category of finite dimensional representations of a certain bound quiver algebra. We generalize results by Saito--Takebayshi…
In this paper we further develop the theory of $\alpha$-induction for nets of subfactors, in particular in view of the system of sectors obtained by mixing the two kinds of induction arising from the two choices of braiding. We construct a…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
Weyl points (WP) are robust spectral degeneracies, which can not be split by small perturbations, as they are protected by their non-zero topological charge. For larger perturbations, WPs can disappear via pairwise annihilation, where two…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…
Motivated by studies of oscillator networks, we study the spectrum of the join of several normal matrices with constant row sums. We apply our results to compute the characteristic polynomial of the join of several regular graphs. We then…
As Lie algebras of compact connected Lie groups, semisimple Lie algebras have wide applications in the description of continuous symmetries of physical systems. Mathematically, semisimple Lie algebra admits a Cartan-Weyl basis of generators…
This paper surveys results related to well-known works of B. Plotkin and V. Remeslennikov on the edge of algebra, logic and geometry. We start from a brief review of the paper and motivations. The first sections deal with model theory. In…
In this paper we show that each non-zero ideal of a twisted generalized Weyl algebra (TGWA) $A$ intersects the centralizer of the distinguished subalgebra $R$ in $A$ non-trivially. We also provide a necessary and sufficient condition for…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…
We provide a direct proof of a conjecture of Brini relating the Gromov-Witten theory of the resolved conifold to the Ablowitz-Ladik integrable hierarchy at the level of primaries. In doing so, we use a functional representation of the…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
We study the non-invertible symmetries of class $\mathcal{S}$ theories obtained by compactifying the type $\mathfrak{a}_{p-1}$ 6d (2,0) theory on a genus $g$ Riemann surface with no punctures. After setting up the general framework, we…
We introduce topological notions of normal crossings symplectic divisor and variety and establish that they are equivalent, in a suitable sense, to the desired geometric notions. Our proposed concept of equivalence of associated topological…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…