English
Related papers

Related papers: On the automorphism groups of Lunardon-Polverino s…

200 papers

For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…

Combinatorics · Mathematics 2024-07-29 Eric Swartz , James A. Davis , John Polhill , Ken W. Smith

In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…

Rings and Algebras · Mathematics 2021-12-07 Umberto Martínez-Peñas

For certain symmetric isogeny $\lambda: A\rightarrow A^\vee$ of abelian varieties over a global field $F$, B. Poonen and E. Rains put an orthogonal quadratic structure on $\mathrm{H}^1(\mathbb{A}_F,A[\lambda])$ and realize the Selmer group…

Number Theory · Mathematics 2025-08-01 Jie Shu

The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…

Combinatorics · Mathematics 2019-02-20 J. Robert Johnson , Imre Leader , Paul A. Russell

In this article we provide a classification of the projective transformations in $PSL(n+1,\Bbb{C})$ considered as automorphisms of the complex projective space $\Bbb{P}^n$. Our classification is an interplay between algebra and dynamics,…

Dynamical Systems · Mathematics 2017-01-05 Angel Cano , Luis Loeza , Alejandro Ucan

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Combinatorics · Mathematics 2026-05-27 Arnau Padrol , Germain Poullot

We describe, up to degree equal to the rank, the Lie algebra associated with the automorphism group of a free group. We compute in particular the ranks of its homogeneous components, and their structure as modules over the linear group.…

Group Theory · Mathematics 2016-09-28 Laurent Bartholdi

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

Computational Complexity · Computer Science 2016-10-26 Gábor Braun , Samuel Fiorini , Sebastian Pokutta

We consider the question of continuity of limit sets for sequences of geometrically finite subgroups of isometry groups of rank-one symmetric spaces, and prove analogues of classical (Kleinian) theorems in this context. In particular we…

Geometric Topology · Mathematics 2024-07-08 Antonin Guilloux , Theodore Weisman

In this paper we define a new class of partially filled arrays, called $\lambda$-fold relative Heffter arrays, that are a generalisation of the Heffter arrays introduced by Archdeacon in 2015. After showing the connection of this new…

Combinatorics · Mathematics 2021-06-09 Simone Costa , Anita Pasotti

We consider Kazhdan-Lusztig cells of the symmetric group $S_n$ containing the longest element of a standard parabolic subgroup of $S_n$. Extending some of the ideas in [Beitr{\"a}ge zur Algebra und Geometrie, 59 (2018), no. 3, 523-547] and…

Representation Theory · Mathematics 2021-12-14 T. P. McDonough , C. A. Pallikaros

We give a complete classification of homomorphisms from the commutator subgroup of the braid group on $n$ strands to the braid group on $n$ strands when $n$ is at least 7. In particular, we show that each nontrivial homomorphism extends to…

Geometric Topology · Mathematics 2022-03-14 Kevin Kordek , Dan Margalit

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

We give a construction which produces irreducible complex rigid local systems on $\Bbb{P}_{\Bbb{C}}^1-\{p_1,\dots,p_s\}$ via quantum Schubert calculus and strange duality. These local systems are unitary and arise from a study of vertices…

Algebraic Geometry · Mathematics 2021-12-10 Prakash Belkale

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

Optimization and Control · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under…

Machine Learning · Computer Science 2026-03-26 Ron Holzman , Shay Moran , Alexander Shlimovich

A family of stable mixed finite elements for the linear elasticity on tetrahedral grids are constructed, where the stress is approximated by symmetric $H(\d)$-$P_k$ polynomial tensors and the displacement is approximated by…

Numerical Analysis · Mathematics 2015-06-22 Jun Hu , Shangyou Zhang

In this article we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models…

Combinatorics · Mathematics 2022-08-10 Isobel Davies , Eliana Duarte , Irem Portakal , Miruna-Stefana Sorea

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

Combinatorics · Mathematics 2012-10-23 Tuvi Etzion , Alexander Vardy

Let $X$ be a $d$-partite $d$-dimensional simplicial complex with parts $T_1,\dots,T_d$ and let $\mu$ be a distribution on the facets of $X$. Informally, we say $(X,\mu)$ is a path complex if for any $i<j<k$ and $F \in T_i,G \in T_j, K\in…

Combinatorics · Mathematics 2025-12-10 Jonathan Leake , Kasper Lindberg , Shayan Oveis Gharan