相关论文: Critical sets in the elementary abelian 2- and 3- …

We use the shear construction to construct and classify a wide range of two-step solvable Lie groups admitting a left-invariant SKT structure. We reduce this to a specification of SKT shear data on Abelian Lie algebras, and which then is…

In this paper, we give a new upper bound on the minimum Euclidean weight of Type II $\ZZ_{2k}$-codes and the concept of extremality for the Euclidean weights when $k=3,4,5,6$. Together with the known result, we demonstrate that there is an…

Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…

We shortly present two small results regarding the study formal duality in finite abelian groups as introduced by Cohn, Kumar, Reiher and Sch\"urmann. In particular, we give a new example of a formally self dual set in…

By adapting the technique of David, Koukoulopoulos and Smith for computing sums of Euler products, and using their interpretation of results of Schoof \`a la Gekeler, we determine the average number of subgroups (or cyclic subgroups) of an…

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements $x,y,z$ with $x+y=z$. The study of how large the largest sum-free subset of a given abelian group is had started more…

In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

The existence of an extremal self-dual binary linear code C of length 72 is a long-standing open problem. We continue the investigation of its automorphism group: looking at the combination of the subcodes fixed by different involutions and…

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…

In this paper, we apply our minimax theory ([4], [5], [6]) with the one developed by A. Moameni in [2] to formalize a general scheme giving the multiplicity of critical points. Here is a sample of application of the scheme to a critical…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

In this paper we study critical sets of solutions $u_\e$ of second-order elliptic equations in divergence form with rapidly oscillating and periodic coefficients. We show that the $(d-2)$-dimensional Hausdorff measures of the critical sets…

We prove that the smallest degree of an apolar 0-dimensional scheme of a general cubic form in $n+1$ variables is at most $2n+2$, when $n\geq 8$, and therefore smaller than the rank of the form. For the general reducible cubic form the…

The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on…

By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as $p_{c1} < 0.355059$, while the upper threshold is bounded both from above and below by 1/2 according to…

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…