Related papers: Upper Bounds for Totally Symmetric Sets
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
In this paper, we introduce a symmetric continuous cohomology of topological groups. This is obtained by topologizing a recent construction due to Staic (J. Algebra 322 (2009), 1360-1378), where a symmetric cohomology of abstract groups is…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
The method of range decreasing group homomorphisms can be applied to study various maps between mapping spaces, includin holomorphic maps, group homomorphisms, linear maps, semigroup homomorphisms, Lie algebra homomorphisms and algebra…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
Space group theory is pivotal in the design of nanophotonics devices, enabling the characterization of periodic optical structures such as photonic crystals. The aim of this study is to extend the application of nonsymmorphic space groups…
We introduce the notion of algebraic higher symmetry, which generalizes higher symmetry and is beyond higher group. We show that an algebraic higher symmetry in a bosonic system in $n$-dimensional space is characterized and classified by a…
We give a formula for the geometric fixed-points spectrum of the real topological cyclic homology of a bounded below ring spectrum, as an equaliser of two maps between tensor products of modules over the norm. We then use this formula to…
In any category with a reasonable notion of cover, each object has a group of scissors automorphisms. We prove that under mild conditions, the homology of this group is independent of the object, and can be expressed in terms of the…
First we introduce a generalization of symmetric spaces to parabolic geometries. We provide construction of such parabolic geometries starting with classical symmetric spaces and we show that all regular parabolic geometries with smooth…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
We study groups of homeomorphic bijections on spaces that are finite unions of compact connected linearly ordered subsets. We prove that all such groups when endowed with the topology of point-wise convergence are topological groups. }
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
A class of subgroups is obtained for symmetric groups using signed Brauer diagrams.
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…
Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…