相关论文: Acyclic Jacobi Diagrams

We introduce two refinements of the class of $5/2$-groups, inspired by the classes of automorphism groups of configurations and automorphism groups of unit circulant digraphs. We show that both of these classes have the property that any…

We study the bispectrality of Jacobi type polynomials, which are eigenfunctions of higher-order differential operators and can be defined by taking suitable linear combinations of a fixed number of consecutive Jacobi polynomials. Jacobi…

We classify algebraic curvature tensors such that the Ricci operator is simple (i.e. the Ricci operator is complex diagonalizable and either the complex spectrum consists of a single real eigenvalue or the complex spectrum consists of a…

The Jacobian algebras are introduced and their various properties are studied.

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…

Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a…

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…

In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…

We study twisted Jacobi manifolds, a concept that we had introduced in a previous Note. Twisted Jacobi manifolds can be characterized using twisted Dirac-Jacobi, which are sub-bundles of Courant-Jacobi algebroids. We show that each twisted…

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…

We study asymptotics of generalized eigenvectors associated with Jacobi matrices. Under weak conditions on the coefficients we identify when the matrices are self-adjoint and show that they satisfy strong non-subordinacy condition.

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting…

We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…

Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…

We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…

We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…