scientific article

From MaRDI portal
Revision as of 17:21, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3851094

zbMath0112.24806MaRDI QIDQ3851094

No author found.

Publication date: 1963


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Formulations of the inclusion–exclusion principle from Legendre to Poincaré, with emphasis on Daniel Augusto da SilvaGeneralized Krawtchouk polynomials and the composition schemeEigenvalues of Circulant Matrices and a Conjecture of RyserThreshold SequencesEntropy and the complexity of graphs: I. An index of the relative complexity of a graphEntropy and the complexity of graphs: III. Graphs with prescribed information contentOn Signed Branching Markov Processes with AgeГлобализация анализа моделей размещения частиц по ячейкамChains and Antichains in the Bruhat Order for Classes of (0, 1)-MatricesState-Dependent Kernel Selection for Conditional Sampling of GraphsRyser's permanent identity in the symmetric algebraUnnamed ItemComputer cryptographic techniques for processing and storage of confidential information†On branching Markov processesDirected star decompositions of the complete directed graphAccuracy and stability of quaternion Gaussian eliminationInapproximability of positive semidefinite permanents and quantum state tomography\texttt{QOptCraft}: a python package for the design and study of linear optical quantum systemsROhAN: row-order agnostic null models for statistically-sound knowledge discoveryA note on internal partitions: the 5-regular case and beyondStrong simulation of linear optical processesInvariants of quadratic forms and applications in design theorySS/TDMA Satellite Communications withk-Permutation Switching ModesStructure of the variety of alternative algebras with the Lie-nilpotency identity of degree 5Unnamed ItemCounting Integral Points in Polytopes via Numerical Analysis of Contour IntegrationOn data retrieval from unambiguous bit matricesSphere decompositions of hypercubesCoprime permutationsConstructing and sampling directed graphs with given degree sequencesDifference graphsA. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs”A Faster Tree-Decomposition Based Algorithm for Counting Linear ExtensionsUnnamed Item ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions] ⋮ Fast computation of the exact null distribution of Spearman's \(\rho\) and Page's \(L\) statistic for samples with and without tiesA construction of group divisible designsDoubly transitive permutation groups which are not doubly primitiveThe Hadamard core of the totally nonnegative matricesIterated homology and decompositions of simplicial complexesMatrix factorizations of determinants and permanentsDiagonal sums of doubly stochastic matricesReconstruction of domino tiling from its two orthogonal projectionsReconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atomsUnnamed ItemUnnamed ItemUnnamed ItemX-rays characterizing some classes of discrete setsReconstruction of 4- and 8-connected convex discrete sets from row and column projectionsMinimal nonnegative integral matrices and uniquely determined (0,1)-matricesMicroreversibility, nonequilibrium current fluctuations, and response theoryThe use of jacobi's lemma in unimodularity theoryThe \(k\)-distinct language: parameterized automata constructionsOn the depth complexity of formulasSystems of representativesOn the solution of multiattribute problems involving counting in intersecting setsComputing permanents and counting Hamiltonian cycles by listing dissimilar vectorsOn the classical complexity of sampling from quantum interference of indistinguishable bosonsMicroreversibility and nonequilibrium response theory in magnetic fieldsMatrix permanent and quantum entanglement of permutation invariant statesA multilinearity property of determinant functionsEfficient algorithms for approximating quantum partition functionsThe Waring Rank of the 3 x 3 PermanentUnnamed ItemUnnamed ItemComputing the permanent modulo a prime powerFormal duality in finite cyclic groupsThe structure matrix and a generalization of Ryser's maximum term rank formulaA Walsh–Fourier Approach to the Circulant Hadamard ConjectureUnnamed ItemA hidden orthogonal Latin square in a work of Euler from 1770Maximum length codes and their relation with the incomplete block designGeometria combinatoria e geometrie finitePartial distinguishability as a coherence resource in boson samplingA Tighter Bound for Counting Max-Weight Solutions to 2SAT InstancesSome upper bounds for permanents of (0, 1)-matricesPermutation classes and polyomino classes with excluded submatricesCAZAC Sequences and Haagerup’s Characterization of Cyclic N-rootsEfficient computation of the permanent of a sparse matrixOn the parity of permanents of circulant matricesA solvable case of image reconstruction in discrete tomographyIntegral approximation sequencesÜber Blockpläne mit transitiver DilatationsgruppeMinkowski planesOn permutation groups of prime degree p which contain (at least) two classes of conjugate subgroups of index pExtremal configurations and decomposition theorems. ICombinatorial equivalence of (0,1) circulant matricesArithmetic Circuits: A Chasm at Depth 3On a class of doubly, but not triply transitive permutation groupsAn extension of a theorem of the Bruijn and Erdős on combinatorial designsUnbalanced Hadamard matrices and finite projective planes of even orderPivot size in Gaussian eliminationQuasi-residual designsA market problemAn investigation of Bhattacharya-type designsTerm ranks and permanents of nonnegative matricesOn inequivalent balanced incomplete block designs. IIMaximal subgroups of the semigroup of relationsCombinatorial designs and related systemsA lower bound for the permanent on \(U_ n(k,k)\)







This page was built for publication: