Related papers: The Multiple Equal-Difference Structure of Cycloto…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…
We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over…
Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…
Motivated by the work of Panina and her coauthors on cyclopermutohedron we study a poset whose elements correspond to equivalence classes of partitions of the set $\{1,\cdots, n+1\}$ up to cyclic permutations and orientation reversion. This…
An {\em orthomorphism} over a finite field $\mathbb{F}$ is a permutation $\theta:\mathbb{F}\mapsto\mathbb{F}$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}$. The orthomorphism $\theta$ is {\em cyclotomic of…
We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
We can associate with any irreducible curve singularity (ics) a numerical semigroup. Two ics are said to be equisingular if they have the same semigroup. Two equisingular ics have the same Milnor number. Conversely, The set of ics with a…
Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…
Embedding Calculus, as described by Weiss, is a calculus of functors, suitable for studying contravariant functors from the poset of open subsets of a smooth manifold M, denoted O(M), to a category of topological spaces (of which the…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
A code is said to be equidistant if the distance between any two distinct codewords of the code is the same. In this paper, we have studied equidistant single-orbit cyclic and quasi-cyclic subspace codes. The orbit code generated by a…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
In this paper some properties of the irreducible multiplets of representation for the N = (p, q) - extended supersymmetry in one dimension are discussed. Essentially two results are here presented. At first a peculiar property of the one…