English
Related papers

Related papers: Decidability in geometric grid classes of permutat…

200 papers

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

Logic in Computer Science · Computer Science 2024-11-26 Sebastian Siebertz , Alexandre Vigny

We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…

Algebraic Geometry · Mathematics 2023-10-06 Takashi Ichikawa

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

Combinatorics · Mathematics 2007-05-23 Vladimir Ivanov , Sergei Kerov

Let $F$ be a field of characteristic zero. We prove that if a group grading on $UT_m(F)$ admits a graded involution then this grading is a coarsening of a $\mathbb{Z}^{\lfloor\frac{m}{2}\rfloor}$-grading on $UT_m(F)$ and the graded…

Rings and Algebras · Mathematics 2023-05-16 Diogo Diniz , Alex Ramos

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

Group Theory · Mathematics 2012-03-15 Henry Cohn , Christopher Umans

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…

Logic in Computer Science · Computer Science 2023-06-22 Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

We explicitly construct a (unitary) $\mathbb{Z}/2\mathbb{Z}$ permutation gauging of a (unitary) modular category $\mathcal{C}$. In particular, the formula for the modular data of the gauged theory is provided in terms of modular data of…

Quantum Algebra · Mathematics 2024-12-06 Zhengwei Liu , Yuze Ruan

We construct a converging geometric iterated function system on the moduli space of ordered triangles, for which the involved functions have geometric meanings and contain a non-contraction map under the natural metric.

Dynamical Systems · Mathematics 2016-05-09 Jiajun Wang , Ying Zhang

We give a geometric perspective on the algebra of Drinfeld modular forms for congruence subgroups $\Gamma\leq \GL_2(\bbF_q[T]).$ In particular, we describe an isomorphism between the section ring of a line bundle on the stacky modular curve…

Number Theory · Mathematics 2024-10-15 Jesse Franklin

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

General Mathematics · Mathematics 2007-05-23 G. Bergdolt

The theory of $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ is decidable if $a$ is quadratic. If $a$ is the golden ratio, $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ defines multiplication by $a$. The results are established by using the…

Logic · Mathematics 2017-04-21 Philipp Hieronymi

We compute the motive of the classifying stack of an orthogonal group in the Grothendieck ring of stacks over a field of characteristic different from two.

Algebraic Geometry · Mathematics 2018-09-11 Ajneet Dhillon , Matthew B. Young

The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…

Artificial Intelligence · Computer Science 2024-01-23 Pedro Quaresma , Pierluigi Graziani , Stefano M. Nicoletti

Let $X$ be a smooth complex projective algebraic variety. Let $\mathcal{G}$ be a $G$-banded gerbe with $G$ a finite abelian group. We prove an exact formula expressing genus $g$ orbifold Gromov-Witten invariants of $\mathcal{G}$ in terms of…

Algebraic Geometry · Mathematics 2011-02-02 Elena Andreini , Yunfeng Jiang , Hsian-Hua Tseng

The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…

Representation Theory · Mathematics 2018-01-31 Arkady Berenstein , Karl Schmidt

A $G$-graded extension of a fusion category $\mathcal{C}$ yields a categorical action of $G$ on the center $Z(\mathcal C)$. If the extension admits a spherical structure, we provide a method for recovering its fusion rules in terms of the…

Quantum Algebra · Mathematics 2021-09-20 Marcel Bischoff , Corey Jones

Functional bases of second-order differential invariants of the Euclid, Poincar\'e, Galilei, conformal, and projective algebras are constructed. The results obtained allow us to describe new classes of nonlinear many-dimensional invariant…

Mathematical Physics · Physics 2007-05-23 W. I. Fushchych , Irina Yehorchenko

There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…

Logic · Mathematics 2014-12-16 Fedor Pakhomov

In this paper, we describe non invertible matrix in GF(2)which can be used as multiplication matrix in Hill Cipher technique for one way hash algorithm. The matrices proposed are permutation matrices with exactly one entry 1 in each row and…

Cryptography and Security · Computer Science 2012-10-09 Artan Berisha , Behar Baxhaku , Artan Alidema
‹ Prev 1 8 9 10 Next ›