Related papers: Some New Balanced and Almost Balanced Quaternary S…
We study restricted chain-order polytopes associated to Young diagrams using combinatorial mutations. These polytopes are obtained by intersecting chain-order polytopes with certain hyperplanes. The family of chain-order polytopes…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
We investigate the low-lying zeros in families of $L$-functions attached to quadratic and cubic twists of elliptic curves defined over $\mathbb{F}_q(T)$. In particular, we present precise expressions for the expected values of traces of…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…
This paper establishes new restrictions for attainable enhanced principal rank characteristic sequences (epr-sequences). These results are then used to classify two related families of sequences that are attainable by a real symmetric…
Experimental results show that, when the order $n$ is odd, there are de Bruijn sequences such that the corresponding complement sequence and the reverse sequence are the same. In this paper, we propose one efficient method to generate such…
In the circular case of the coplanar Restricted Three-body Problem, we studied how the family of quasi-satellite (QS) periodic orbits allows to define an associated libration center. Using the averaged problem, we highlighted a validity…
Even- and odd-frequency superconductivity coexist due to broken time-reversal symmetry under magnetic field. In order to describe this mixing, we extend the linearized Eliashberg equation for the spin and charge fluctuation mechanism in…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
The paper investigates a significant part of the automorphic, in fact of the so-called Eisenstein cohomology of split odd orthogonal groups over Q. The main result provides a description of residual and regular Eisenstein cohomology classes…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We construct many new cyclic (v;r,s;lambda) difference families with v less than or equal 50. In particular we construct the difference families with parameters (45;18,10;9), (45;22,22;21), (47;21,12;12), (47;19,15;12), (47;22,14;14),…
The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived…
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal…
Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure…
We investigate odd-in-time - or odd-frequency - pairing of fermions in equilibrium systems within the particle-number-conserving framework of Penrose, Onsager and Yang, where superfluid order is defined by macroscopic eigenvalues of reduced…
We show that a graph has an orientation under which every circuit of even length is clockwise odd if and only if the graph contains no subgraph which is, after the contraction of at most one circuit of odd length, an even subdivision of…
Binary self-dual cyclic codes have been studied since the classical work of Sloane and Thompson published in IEEE Trans. Inf. Theory, vol. 29, 1983. Twenty five years later, an infinite family of binary self-dual cyclic codes with lengths…
This paper examines Automatic Complexity, a complexity notion introduced by Shallit and Wang in 2001. We demonstrate that there exists a normal sequence $T$ such that $I(T) = 0$ and $S(T) \leq 1/2$, where $I(T)$ and $S(T)$ are the lower and…