Related papers: Computing isolated orbifolds in weighted flag vari…

We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…

We present a classification algorithm for Calabi-Yau complete intersections arising from nef-partitions in fake weighted projective spaces, allowing us to determine all such complete intersections up to dimension five. Furthermore, we…

We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

The vertex PI index is a distance--based molecular structure descriptor, that recently found numerous chemical applications. In order to increase diversity of this topological index for bipartite graphs, we introduce weighted version…

We attempt to define a new invariant I of (almost) Calabi-Yau 3-folds M, by counting special Lagrangian rational homology 3-spheres N in M in each 3-homology class, with a certain weight w(N) depending on the topology of N. This is…

We consider the classification problem of prime $\mathbb{Q}$-Fano 3-folds with at most $1/2(1,1,1)$-singularities, which was initiated in [Taka2]. We construct two distinct classes of such 3-folds with genus one and six…

Given a set S of n points, a weight function w to associate a non-negative weight to each point in S, a positive integer k \ge 1, and a real number \epsilon > 0, we present algorithms for computing a spanner network G(S, E) for the metric…

We give a deterministic, nearly logarithmic-space algorithm for mild spectral sparsification of undirected graphs. Given a weighted, undirected graph $G$ on $n$ vertices described by a binary string of length $N$, an integer $k\leq \log n$,…

We study the maximum weight perfect $f$-factor problem on any general simple graph $G=(V,E,w)$ with positive integral edge weights $w$, and $n=|V|$, $m=|E|$. When we have a function $f:V\rightarrow \mathbb{N}_+$ on vertices, a perfect…

We provide a fine classification of rigid three-dimensional torus quotients with isolated canonical singularities, up to biholomorphism and diffeomorphism. This complements the classification of Calabi-Yau 3-folds of type $\rm{III}_0$,…

In the context of Berglund-Huebsch mirror symmetry, we compute the eigenvalues of the Frobenius endomorphism acting on a p-adic version of Borisov's complex. As a result, we conjecture an explicit formula for the number of points of crepant…

We use incidence relations running in two directions in order to construct a Kempf-Laksov type resolution for any Schubert variety of the complete flag manifold but also an embedded resolution for any Schubert variety in the Grassmannian.…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

We study the gauging of invertible symmetries, particularly in 3 dimensions, using equivariantisation, $G$-crossed braided zesting, and the generalised orbifold construction. We discuss how these methods are related and illustrate them in…

In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…

There is a strong analogy between compact, torsion-free $G_2$-manifolds $(X,\varphi,*\varphi)$ and Calabi-Yau 3-folds $(Y,J,g,\omega)$. We can also generalize $(X,\varphi,*\varphi)$ to 'tamed almost $G_2$-manifolds' $(X,\varphi,\psi)$,…

We discuss combinatorial algorithms for finding a maximum weight $f$-factor on an arbitrary multigraph, for given integral weights of magnitude at most $W$. For simple bipartite graphs the best-known time bound is $O(n^{2/3}\, m\, \log nW)$…

Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum…

We prove that the number of complex invariant Einstein metrics on the flag manifold $M_{n_1,n_2,n_3}=SO_{2(n_1+n_2+n_3)+1}/U_{n_1} \times U_{n_2} \times SO_{2n_3+1}$ is equal to 132, except when the parameters $n_1, n_2, n_3$ satisfy one of…