Related papers: Detecting Zariski Pairs by Algorithms and Computat…
The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…
Alt $\nu$-Tamari lattices constitute a remarkable family of lattices associated with lattice paths that broadly generalize the Dyck and Tamari lattices. To systematically study the structural properties of this family, we introduce a…
Explaining neural network models is important for increasing their trustworthiness in real-world applications. Most existing methods generate post-hoc explanations for neural network models by identifying individual feature attributions or…
We give conditions under which the monodromy group of an $A$-hypergeometric system is invariant under modifications of the collection of characters $A$. The key ingredient is a Zariski--Lefschetz type theorem for principal $A$-determinants.
The cohomology of coherent sheaves and sheaves of Abelian groups on Noetherian schemes are interpreted in second order arithmetic by means of a finiteness theorem. This finiteness theorem provably fails for the etale topology even on…
In this paper, we propose a novel semi-parametric probabilistic model which considers interactions between different communities and can provide more information about the network topology besides correctly detecting communities. By using…
G\"unter Ziegler has shown in 1989 that some homological invariants associated with the free resolutions of Jacobian ideals of line arrangements are not determined by combinatorics. His classical example involves hexagons inscribed in…
We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…
We investigate topologies on groups which arise naturally from their algebraic structure, including the Frech\'et-Markov, Hausdorff-Markov, and various kinds of Zariski topologies. Answering a question by Dikranjan and Toller, we show that…
Predicting protein interactions is one of the more interesting challenges of the post-genomic era. Many algorithms address this problem as a binary classification problem: given two proteins represented as two vectors of features, predict…
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
In this short note, we classify pairs of conjugacy classes of the symmetric group such that any non-linear irreducible character of the symmetric group vanishes on at least one of them.
In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an…
Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correlation and multimodality in the posterior distribution over…
In this article, examples of Zariski pairs $(B_1, B_2)$ satisfying the following condition are given: (i) $\deg B_1 = \deg B_2 = 7$. (ii) Irreducible components of $B_i$ $(i = 1, 2)$ are lines and conics. (iii) Singularities of $B_i$ $(i =…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
We prove that the conjugacy problem in the first Grigorchuck group $\Gamma$ can be solved in linear time. Furthermore, the problem to decide if a list of elements $w_1,\ldots,w_k\in\Gamma$ contains a pair of conjugate elements can be solved…
Based on signaling process on complex networks, a method for identification community structure is proposed. For a network with $n$ nodes, every node is assumed to be a system which can send, receive, and record signals. Each node is taken…
Community detection is a critical challenge in analysing real graphs, including social, transportation, citation, cybersecurity, and many other networks. This article proposes three new, general, hierarchical frameworks to deal with this…