Related papers: Semi-invariants of binary forms and symmetrized gr…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…
In the example of complex grassmannians, we demonstrate various techniques available for computing genus-0 K-theoretic GW-invariants of flag manifolds and more general quiver varieties. In particular, we address explicit reconstruction of…
We investigate the maximum size of graph families on a common vertex set of cardinality $n$ such that the symmetric difference of the edge sets of any two members of the family satisfies some prescribed condition. We solve the problem…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We investigate the rings of semi-invariants for tame string algebras A(n) of non-polynomial growth. We are interested in dimension vectors of band modules. We use geometric technique related to the description of coordinate rings on…
Skew-symmetric differential forms play an unique role in mathematics and mathematical physics. This relates to the fact that closed exterior skew-symmetric differential forms are invariants. The concept of "Exterior differential forms" was…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
We study the semi-random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi-random graph $G$ that has property ${\mathcal P}$, for…
We define an infinite set of families of graphs, which we call $p$-wheels and denote $(Wh)^{(p)}_n$, that generalize the wheel ($p=1$) and biwheel ($p=2$) graphs. The chromatic polynomial for $(Wh)^{(p)}_n$ is calculated, and remarkably…
Let $L$ be one of the finite dimensional Lie algebras $W_n({\bf m}),$ $S_n({\bf m}),$ $ H_n({\bf m})$ of Cartan type over an algebraically closed field of prime characteristic $p>0.$ For an elements $F$ of the symmetrical algebra $S(L)$ we…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…
We construct the ${\cal N}=1$ supersymmetric extension of Double Field Theory for Riemannian and the non-Riemannian in a unified approach. The inclusion of fermions in the double geometry force us to use the generalized frame formalism to…
We consider inhomogeneous supersymmetric bilinear forms, i.e., forms that are neither even nor odd. We classify such forms up to dimension seven in the case when the restrictions of the form to the even and odd parts of the superspace are…
Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…