arXiv subjects
Publications and source records attributed to Christian Valqui.
We provide a complete classification of extensions of a trivial linear cycle set H by an abelian group I, under the assumption that both H and I are finite cyclic p-groups with p odd, or p = 2 and H has at most four elements. This yields an explicit parametrization of all possible extensions, offering a classification that is both comprehensive and computable. We also compute the socle and the center of all the linear cycle sets obtained.
This paper analyzes the second cohomology group of a linear cycle set with coefficients in an abelian group I, for linear cycle sets with commutative adjoint operation, focusing on the finite abelian case. It aims to classify extensions of such structures through cohomological methods. Techniques are developed to systematically construct explicitly 2-cocycles. Finally, some illustrative examples are explored to validate the theoretical framework.
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and establish conditions under which the extensions are fully determined. Key results include a characterization of extensions when I lies in the socle of the extended structure and H is trivial, and the construction of explicit examples for both trivial and non-trivial cases. The paper provides a systematic approach to understanding the structure of these extensions, with applications to various families of abelian groups.
In this paper we determine all the Hopf q-brace structures on rank one pointed Hopf algebras and compute the socle of each one of them. We also identify which among them are Hopf skew-braces. Then we determine when two Hopf q-brace structures on rank one pointed Hopf algebras are isomorphic, and, finally, we compute all the weak braiding operators on these Hopf algebras.
Assume that $P$ and $Q$ are elements of $A_1$ satisfying $[P,Q] = 1$. The Dixmier Conjecture for $A_1$ says that they always generate $A_1$. We show that if $P$ is a sum of not more than~$4$ homogeneous elements of $A_1$ then $P$ and $Q$ generate $A_1$, which generalizes the main result in arXiv:2210.00257.
A conjecture attributed to Smith states that every pair of longest cycles in a $k$-connected graph intersect each other in at least $k$ vertices. In this paper, we show that every pair of longest cycles in a~$k$-connected graph on $n$ vertices intersect each other in at least~$\min\{n,8k-n-16\}$ vertices, which confirms Smith's conjecture when $k\geq (n+16)/7$. An analog conjecture for paths instead of cycles was stated by Hippchen. By a simple reduction, we relate both conjectures, showing that Hippchen's conjecture is valid when either $k \leq 6$ or $k \geq (n+9)/7$.
We list all the pairs $(deg(P),deg(Q))$ with $\max\{deg(P),deg(Q)\}< 125$ for any hypothetical counterexample to the plane Jacobian Conjecture and discard them all, except the pair $(72,108)$ (and the symmetric pair $(108,72)$), thus we confirm the lower bound of 100 obtained by Moh and raise it up to 108.
We generalize the cohomology theory for linear cycle sets introduced by Lebed and Vendramin. Our cohomology classifies extensions of linear cycle sets by trivial ideals, whereas the cohomology of Lebed and Vendramin only deals with central ideals $I$ (which are automatically trivial). Therefore our theory gives an analog to the theory of extensions of braces by trivial ideals constructed by Bachiller, but from a cohomological point of view. We also study the general notions of extensions of linear cycle sets and the equivalence of extensions.
We use a representation of a graded twisted tensor product of $K[x]$ with $K[y]$ in $L(K^{\Bbb{N}_0})$ in order to obtain a nearly complete classification of these graded twisted tensor products via infinite matrices. There is one particular example and three main cases: quadratic algebras classified by Conner and Goetz, a family called $A(n,d,a)$ with the $n+1$-extension property for $n\ge 2$, and a third case, not fully classified, which contains a family $B(a,L)$ parameterized by quasi-balanced sequences.
In order to construct solutions of the braid equation we consider bijective left non-degenerate set-theoretic type solutions, which correspond to regular q-cycle coalgebras. We obtain a partial classification of the different q-cycle coalgebra structures on the dual coalgebra of $K[y]/\langle y^n\rangle$, the truncated polynomial algebra. We obtain an interesting family of involutive q-cycle coalgebras which we call Standard Cycle Coalgebras. They are parameterized by free parameters $\{p_1,...,p_{n-1}\}$ and in order to verify that they are compatible with the braid equation, we have to verify that certain differential operators $\partial^j$ on formal power series in two variables $K[[x, y]]$ satisfy the condition $(\partial^j G)_i = (\partial^i G)_j$ for all i, j, where $G$ is a formal power series associated to the given q-cycle coalgebra. It would be interesting to find out the relation of these operators with the operators given by Yang in the context with 2-dimensional quantum field theories, which was one of the origins of the Yang-Baxter equation.
Let $P,Q$ be longest paths in a simple graph. We analyze the possible connections between the components of $P\cup Q\setminus (V(P)\cap V(Q))$ and introduce the notion of a bi-traceable graph. We use the results for all the possible configurations of the intersection points when $\#V(P)\cap V(Q)\le 5$ in order to prove that if the intersection of three longest paths $P,Q,R$ is empty, then $\#(V(P)\cap V(Q))\ge 6$. We also prove Hippchen's conjecture for $k\le 6$: If a graph $G$ is $k$-connected for $k\le 6$, and $P$ and $Q$ are longest paths in $G$, then $\#(V(P)\cap V(Q))\ge 6$.
We prove that for a connected simple graph $G$ with $n\le 10$ vertices, and two longest paths $C$ and $D$ in $G$, the intersection of vertex sets $V(C)\cap V(D)$ is a separator. This shows that the graph found previously with $n=11$, in which the complement of the intersection of vertex sets $V(C)\cap V(D)$ of two longest paths is connected, is minimal.
We obtain a mixed complex simpler than the canonical one the computes the type cyclic homologies of a crossed product with invertible cocycle $A\times_ρ^f H$, of a weak module algebra $A$ by a weak Hopf algebra $H$ whose unit cocommutes. This complex is provided with a filtration. The spectral sequence of this filtration generalizes the spectral sequence obtained in \cite{CGG}. When $f$ takes its values in a separable subalgebra of $A$ that satisfies suitable conditions, the above mentioned mixed complex is provided with another filtration, whose spectral sequence generalize the Feigin-Tsygan spectral sequence.
In this paper we begin the study of set-theoretic type solution of the braid equation. Our theory includes set-theoretical solutions as basic examples. We show that the relationships between set-theoretical solutions, q-cycle sets, q-braces, skew-braces, matched pairs of groups and invertible $1$-cocycles remain valid in our setting.
In this paper we study the theory of cleft extensions for a weak bialgebra H. Among other results, we determine when two unitary crossed products of an algebra A by H are equivalent and we prove that if H is a weak Hopf algebra, then the categories of H-cleft extensions of an algebra A, and of unitary crossed products of A by H, are equivalent.
We obtain a mixed complex simpler than the canonical one the computes the type cyclic homologies of a crossed product with invertible cocycle $A\times_{\rho}^f H$, of a weak module algebra $A$ by a weak Hopf algebra $H$. This complex is provided with a filtration. The spectral sequence of this filtration generalizes the spectral sequence obtained in \cite{CGG}. When $f$ takes its values in a separable subalgebra of $A$ that satisfies suitable conditions, the above mentioned mixed complex is provided with another filtration, whose spectral sequence generalize the Feigin-Tsygan spectral sequence.
We translate the results of Yansong Xu into the language of~\cite{GGV1}, obtaining nearly the same formulas for the intersection number of Jacobian pairs, but with an inequality instead of an equality.